Recognizing string graphs in NP

Journal of Computer and System Sciences

Volumn 67, Issue 2, 2003, Pages 365-380

  Schaefer, Marcus ^a   Sedgwick, Eric ^a   Štefankovič, Daniel ^b  

^a DEPAUL UNIVERSITY   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

Euler diagrams; Graph drawing; NP completeness; String graphs; Topological inference

Indexed keywords

BOUNDARY CONDITIONS; COMPUTABILITY AND DECIDABILITY; GRAPH THEORY; POLYNOMIALS; THEOREM PROVING;

EULER DIAGRAMS; GRAPH DRAWING; GRAPH RECOGNITION; STRING GRAPHS; TOPOLOGICAL INFERENCE;

COMPUTATIONAL COMPLEXITY;

EID: 0142027848     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00045-X     Document Type: Article

References (26)

1. S. Benzer, On the topology of the genetic fine structure, Proc. Nat. Acad. Sci. 45 (1959) 1607-1620.
2. Z.-Z. Chen, M. Grigni, C. Papadimitriou, Planar map graphs, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), ACM Press, New York, pp. 514-423, 1998.
3. V. Diekert, Personal communication, 2002.
4. V. Diekert, C. Gutiérez, C. Hagenah, Existential theory of equations with rational constraints in free groups is PSPACE-complete, in: Proceedings of the 18th International Symposium on Theoretical Aspects of Computer Science, STACS 2001, pp. 170-182.
5. V. Diekert, Y. Matiyasevich, A. Muscholl, Solving trace equations using lexicographical normal forms, in: Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Italy, 1997, Springer, Berlin-Heidelberg-New York, pp. 336-346. URL citeseer.nj.nec.com/diekert97-solving.html.
6. V. Diekert, Y. Métivier, Partial commutation and traces, in: G. Rozenberg, A. Salomaa (Eds.), Handbook on Formal Languages, Vol. III, Springer, Berlin-Heidelberg-New York, 1997.
7. V. Diekert, A. Muscholl, Solvability of equations in free partially commutative groups is decidable, in: ICALP 2001, pp. 543-554.
8. B. Farb, B. Thurston, Homeomorphisms and simple closed curves, unpublished manuscript, 1991.
9. M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (3) (1983) 312-316.
10. L. Ga̧sieniec, M. Karpinski, W. Plandowski, W. Rytter, Efficient algorithms for Lempel-Ziv encoding, in: Proceedings of SWAT'96, Lecture Notes in Computer Science, Vol. 1097, 1996, pp. 392-403.
11. R.L. Graham, Problem 1, in: Open Problems at 5th Hungarian Colloquium on Combinatorics, 1996.
12. M. Grigni, D. Papadias, C. Papadimitriou, Topological inference, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1995, pp. 901-906.
13. J. Kratochvíl, String Graphs. I. The number of critical nonstring graphs is infinite, J. Combin. Theory, Series B 52 (1991a).
14. J. Kratochvíl, String graphs. II. Recognizing string graphs is NP-hard, J. Combin. Theory, Series B 52 (1991b).
15. J. Kratochvíl, Crossing number of abstract topological graphs, Lecture Notes in Comput. Sci. 1547 (1998) 238-245.
16. J. Kratochvíl, J. Matoušek, String graphs requiring exponential representations, J. Combin. Theory, Series B 53 (1991) 1-4.
17. M. Lothaire, Algebraic Combinatorics on Words, in: Encyclopedia of Mathematics and its Applications, Vol. 90, Cambridge University Press, Cambridge, 2002.
18. J. Matoušek, J. Nešetřil, R. Thomas, On polynomial time decidability of induced-minor-closed classes, Comment. Math. Univ. Carolin. 29 (4) (1988) 703-710.
19. A. Mazurkiewicz, Introduction to trace theory, in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, Chapter 1, 1995, pp. 3-41.
20. J. Pach, G. Tóth, Which crossing number is it anyway?, J. Combin. Theory, Series B 80 (2000) 225-246.
21. J. Pach, G. Tóth, Recognizing string graphs is decidable, in: P. Mutzel (Ed.), Graph Drawing 2001, Lecture Notes in Computer Science, Springer, Berlin, pp. 247-260.
22. W. Plandowski, W. Rytter, Application of Lempel-Ziv encodings to the solution of words equations, Automata, Languages and Programming (1998), 731-742.
23. J.M. Robson, V. Diekert, On quadratic word equations, in: C. Meinel et al. (Eds.), 16th STACS, Trier, 1999, Lecture Notes in Computer Science, Vol. 1563, Springer-Verlag, Berlin, pp. 217-226.
24. M. Schaefer, D. Štefankovič, Decidability of String Graphs, in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-2001), pp. 241-246.
25. F.W. Sinden, Topology of thin film circuits, Bell System Tech. J. 45 (1966) 1639-1662.
26. M. Thorup, Map graphs in polynomial time, in: IEEE Symposium on Foundations of Computer Science, pp. 396-405, 1998.