Marcus Schaefer
ABSTRACT
We show that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a drawing realizing the string graph in the plane. This upper bound confirms a conjecture by Kratochv\'{\i}l and Matou\v{s}ek~\cite{KM91} and settles the long-standing open problem of the decidability of string graph recognition (Sinden~\cite{S66}, Graham~\cite{G76}). Finally we show how to apply the result to solve another old open problem: deciding the existence of Euler diagrams, a central problem of topological inference (Grigni, Papadias, Papadimitriou~\cite{GPP95}).
- 1.J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832-843, Nov. 1983. Google Scholar
Digital Library
- 2.Z.-Z. Chen, M. Grigni, and C. Papadimitriou. Planar map graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 514-523, New York, 1998. ACM Press. Google ScholarDigital Library
- 3.H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10, 1990.Google Scholar
- 4.M. J. Egenhofer. Reasoning about binary topological relations. Lecture Notes in Computer Science, 525:143-160, 1991. Google ScholarDigital Library
- 5.G. Ehrlich, S. Even, and R. E. Tarjan. Intersection graphs of curves in the plane. Journal of Combinatorial Theory, 21, 1976.Google Scholar
- 6.M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312-316, 1983.Google ScholarCross Ref
- 7.R. L. Graham. Problem 1. In Open Problems at 5th Hungarian Colloquium on Combinatorics, 1976.Google Scholar
- 8.M. Grigni, D. Papadias, and C. Papadimitriou. Topological inference. In Proceedings of the 14th International Joint Conference onArtificial Intelligence, pages 901-906, 1995. Google ScholarDigital Library
- 9.M. Grohe. Computing crossing numbers in quadratic time. To appear in Proceedings of the 32nd ACM Symposium on Theory of Computing, 2001. Google ScholarDigital Library
- 10.J. Hass, J. C. Lagarias, and N. Pippenger. The computational complexity of knot and link problems. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS-97), pages 172-181, Los Alamitos, Oct. 20-22 1997. IEEE Computer Society Press. Google ScholarDigital Library
- 11.J. Kratochvil. String graphs. I. the number of critical nonstring graphs is infinite. Journal of Combinatorial Theory, Series B, 52, 1991. Google ScholarDigital Library
- 12.J. Kratochvil. String graphs. II. recognizing string graphs is NP-hard. Journal of Combinatorial Theory, Series B, 52, 1991. Google ScholarDigital Library
- 13.J. Kratochvil. Crossing number of abstract topological graphs. Lecture Notes in Computer Science, 1547:238-245, 1998. Google ScholarDigital Library
- 14.J. Kratochvl and J. Matousek. String graphs requiring exponential representations. Journal of Combinatorial Theory, Series B, 53:1-4, 1991. Google ScholarDigital Library
- 15.O. J. Lemon and I. Pratt. Spatial logic and the complexity of diagrammmatic reasoning. Machine Graphics and Vision, 6(1):89-108, 1997.Google Scholar
- 16.C. H. Papadimitriou, D. Suciu, and V. Vianu. Topological queries in spatial databases. Journal of Computer and System Sciences, 58, 1999. Google ScholarDigital Library
- 17.W. Schnyder. Embedding planar graphs on the grid. In D. Johnson, editor, Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90), pages 138-148, San Francisco, CA, USA, Jan. 1990. SIAM. Google ScholarDigital Library
- 18.F. W. Sinden. Topology of thin film circuits. Bell System Technical Journal, 45:1639-1662, 1966.Google ScholarCross Ref
- 19.C. Tricot. Curves and Fractal Dimension. Springer, 1995.Google ScholarCross Ref
Index Terms
- Decidability of string graphs
Recommendations
String graphs and incomparability graphs
SoCG '12: Proceedings of the twenty-eighth annual symposium on Computational geometryGiven a collection C of curves in the plane, its string graph is defined as the graph with vertex set C, in which two curves in C are adjacent if and only if they intersect. Given a partially ordered set (P,<), its incomparability graph is the graph ...
Recognizing string graphs in NP
STOC '02: Proceedings of the thiry-fourth annual ACM symposium on Theory of computingA string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curves intersect. We show that string graphs can be recognized in NP. The ...
Decidability of string graphs
STOC 2001We show that string graphs can be recognized in nondeterministic exponential time by giving an exponential upper bound on the number of intersections for a minimal drawing realizing a string graph in the plane. This upper bound confirms a conjecture by ...
Comments