2,197 research outputs found
Graph isomorphism completeness for trapezoid graphs
The complexity of the graph isomorphism problem for trapezoid graphs has been
open over a decade. This paper shows that the problem is GI-complete. More
precisely, we show that the graph isomorphism problem is GI-complete for
comparability graphs of partially ordered sets with interval dimension 2 and
height 3. In contrast, the problem is known to be solvable in polynomial time
for comparability graphs of partially ordered sets with interval dimension at
most 2 and height at most 2.Comment: 4 pages, 3 Postscript figure
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
We provide linear-time algorithms for geometric graphs with sublinearly many
crossings. That is, we provide algorithms running in O(n) time on connected
geometric graphs having n vertices and k crossings, where k is smaller than n
by an iterated logarithmic factor. Specific problems we study include Voronoi
diagrams and single-source shortest paths. Our algorithms all run in linear
time in the standard comparison-based computational model; hence, we make no
assumptions about the distribution or bit complexities of edge weights, nor do
we utilize unusual bit-level operations on memory words. Instead, our
algorithms are based on a planarization method that "zeroes in" on edge
crossings, together with methods for extending planar separator decompositions
to geometric graphs with sublinearly many crossings. Incidentally, our
planarization algorithm also solves an open computational geometry problem of
Chazelle for triangulating a self-intersecting polygonal chain having n
segments and k crossings in linear time, for the case when k is sublinear in n
by an iterated logarithmic factor.Comment: Expanded version of a paper appearing at the 20th ACM-SIAM Symposium
on Discrete Algorithms (SODA09
On the intersection of tolerance and cocomparability graphs.
It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability graphs can be efficiently recognized, a positive answer to this conjecture in the general case would enable us to efficiently distinguish between tolerance and bounded tolerance graphs, although it is NP-complete to recognize each of these classes of graphs separately. The conjecture has been proved under some – rather strong – structural assumptions on the input graph; in particular, it has been proved for complements of trees, and later extended to complements of bipartite graphs, and these are the only known results so far. Furthermore, it is known that the intersection of tolerance and cocomparability graphs is contained in the class of trapezoid graphs. In this article we prove that the above conjecture is true for every graph G, whose tolerance representation satisfies a slight assumption; note here that this assumption concerns only the given tolerance representation R of G, rather than any structural property of G. This assumption on the representation is guaranteed by a wide variety of graph classes; for example, our results immediately imply the correctness of the conjecture for complements of triangle-free graphs (which also implies the above-mentioned correctness for complements of bipartite graphs). Our proofs are algorithmic, in the sense that, given a tolerance representation R of a graph G, we describe an algorithm to transform R into a bounded tolerance representation R  ∗  of G. Furthermore, we conjecture that any minimal tolerance graph G that is not a bounded tolerance graph, has a tolerance representation with exactly one unbounded vertex. Our results imply the non-trivial result that, in order to prove the conjecture of Golumbic and Monma, it suffices to prove our conjecture. In addition, there already exists evidence in the literature that our conjecture is true
Placing Arrows in Directed Graph Drawings
We consider the problem of placing arrow heads in directed graph drawings
without them overlapping other drawn objects. This gives drawings where edge
directions can be deduced unambiguously. We show hardness of the problem,
present exact and heuristic algorithms, and report on a practical study.Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
An Infinite Class of Sparse-Yao Spanners
We show that, for any integer k > 5, the Sparse-Yao graph YY_{6k} (also known
as Yao-Yao) is a spanner with stretch factor 11.67. The stretch factor drops
down to 4.75 for k > 7.Comment: 17 pages, 12 figure
Outer Billiards, Arithmetic Graphs, and the Octagon
Outer Billiards is a geometrically inspired dynamical system based on a
convex shape in the plane.
When the shape is a polygon, the system has a combinatorial flavor. In the
polygonal case, there is a natural acceleration of the map, a first return map
to a certain strip in the plane. The arithmetic graph is a geometric encoding
of the symbolic dynamics of this first return map.
In the case of the regular octagon, the case we study, the arithmetic graphs
associated to periodic orbits are polygonal paths in R^8. We are interested in
the asymptotic shapes of these polygonal paths, as the period tends to
infinity. We show that the rescaled limit of essentially any sequence of these
graphs converges to a fractal curve that simultaneously projects one way onto a
variant of the Koch snowflake and another way onto a variant of the Sierpinski
carpet. In a sense, this gives a complete description of the asymptotic
behavior of the symbolic dynamics of the first return map.
What makes all our proofs work is an efficient (and basically well known)
renormalization scheme for the dynamics.Comment: 86 pages, mildly computer-aided proof. My java program
http://www.math.brown.edu/~res/Java/OctoMap2/Main.html illustrates
essentially all the ideas in the paper in an interactive and well-documented
way. This is the second version. The only difference from the first version
is that I simplified the proof of Main Theorem, Statement 2, at the end of
Ch.
- …