# Decidability of string graphs

@inproceedings{Schaefer2001DecidabilityOS,
title={Decidability of string graphs},
author={M. Schaefer and Daniel Stefankovic},
booktitle={STOC '01},
year={2001}
}
• Published in STOC '01 2001
• Computer Science, Mathematics
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… Expand

#### Figures and Topics from this paper

Recognizing string graphs in NP
• Computer Science, Mathematics
• STOC '02
• 2002
It is shown that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochvíl showed that the Recognition problem is NP-hard. Expand
Recognizing String Graphs Is Decidable
• Mathematics, Computer Science
• Discret. Comput. Geom.
• 2002
It is shown that there exists a recursive function f( n) with the property that every string graph of n vertices has a representation in which any two curves cross at most f(n) times. Expand
Simple Realizability of Complete Abstract Topological Graphs in P
• J. Kyncl
• Mathematics, Computer Science
• Discret. Comput. Geom.
• 2011
This work presents a polynomial algorithm which decides whether a given complete AT- graph is simply realizable and shows that other similar realizability problems for (complete) AT-graphs are NP-hard. Expand
String graphs and incomparability graphs
• Computer Science, Mathematics
• SoCG '12
• 2012
It is proved that for every ε>0 there exists δ>0 with the property that if C is a collection of curves whose string graph has at least ε |C|2 edges, then one can select a subcurve γ' of each γ ∈ C such that the string graph of the collection {γ':γ ∈� C} hasAt least δ |C |2 edges and is an incomparability graph. Expand
Almost all string graphs are intersection graphs of plane convex sets
• Computer Science, Mathematics
• SoCG
• 2018
It is obtained that {\em almost all} string graphs on $n$ vertices are intersection graphs of plane convex sets. Expand
String graphs and separators
An expository presentation of several results concerning string graphs, including very recent ones: some string graphs require an exponential number of crossings in every string representation; exponential number is always sufficient; string graphs have small separators; and the current best bound on the crossing number of a graph in terms of paircrossing number is provided. Expand
String graphs and separators
• J. Matousek
• Mathematics, Computer Science
• Geometry, Structure and Randomness in Combinatorics
• 2014
This work provides an expository presentation of several results, including very recent ones: some string graphs require an exponential number of crossings in every string representation; exponential number is always sufficient; string graphs have small separators; and the current best bound on the crossing number of a graph in terms of the pair-crossing number. Expand
The Complexity of Several Realizability Problems for Abstract Topological Graphs
• J. Kyncl
• Mathematics, Computer Science
• Graph Drawing
• 2007
A polynomial algorithm is presented which decides whether a given complete AT- graph is simply realizable and it is shown that other similar realizability problems for (complete) AT-graphs are NP-hard. Expand
Geometric Intersection Graphs: Do Short Cycles Help?
• Mathematics, Computer Science
• COCOON
• 2007
It is proved that recognition of intersection graphs of segments in the plane remains NP-hard for graphs with arbitrarily large girth. Expand
Planar Graphs have Bounded Queue-Number
• Computer Science, Mathematics
• 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
• 2019
It is proved that every proper minor-closed class of graphs has bounded queue-number, and it is shown that every planar graph is a subgraph of the strong product of a path with some graph of bounded treewidth. Expand

#### References

SHOWING 1-10 OF 44 REFERENCES
Recognizing string graphs in NP
• Computer Science, Mathematics
• STOC '02
• 2002
It is shown that the recognition problem for string graphs is in NP, and therefore NP-complete, since Kratochvíl showed that the Recognition problem is NP-hard. Expand
Recognizing String Graphs Is Decidable
• Mathematics, Computer Science
• Graph Drawing
• 2001
It is shown that there exists a recursive function f( n) with the property that every string graph of n vertices has a representation in which any two curves cross at most f(n) times. Expand
String graphs. I. The number of critical nonstring graphs is infinite
• J. Kratochvíl
• Computer Science, Mathematics
• J. Comb. Theory, Ser. B
• 1991
The question of whether there are infinitely many nonisomorphic critical nonstring graphs has been an open problem for some time and the main result of this paper settles this question. Expand
Crossing Number of Abstract Topological Graphs
The problem of drawing graphs in the plane so that only certain specified pairs of edges are allowed to cross is revoked, and a new conjecture is stated that would solve the problem of algorithmic decidability of recognition of string graphs as well as realizability of abstract topological graphs and feasible drawability of graphs with restricted edge crossings. Expand
Map graphs in polynomial time
• M. Thorup
• Mathematics, Computer Science
• Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
• 1998
Chen et al. conjectured that map graphs can be recognized in polynomial time, and in this paper, their conjecture is settled affirmatively. Expand
How to draw a planar graph on a grid
• Mathematics, Computer Science
• Comb.
• 1990
It is shown that any setF, which can support a Fáry embedding of every planar graph of sizen, has cardinality at leastn+(1−o(1))√n which settles a problem of Mohar. Expand
The computational complexity of knot and link problems
• Mathematics, Computer Science
• JACM
• 1999
We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, ie., capable of being continuously deformed without self-intersection so that it lies in aExpand
Computing crossing numbers in quadratic time
It is shown that for every fixed k, there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and computes a drawing of the graph in the plane with at mostk crossings. Expand
Linear-time recognition of circular-arc graphs
• R. McConnell
• Mathematics, Computer Science
• Proceedings 2001 IEEE International Conference on Cluster Computing
• 2001
A linear time bound is given for recognizing this class of graphs G, which is a circular-arc graph if it is the intersection graph of a set of arcs on a circle. Expand
Planar map graphs
• Computer Science
• STOC '98
• 1998
A modi ed notion of planarity is introduced, in which two regions of a map are considered adjacent when they share any point of their boundaries (not an edge, as standard planarity requires), and some preliminary properties of such graphs are proved. Expand