Decidability of string graphs

Journal of Computer and System Sciences

Volumn 68, Issue 2, 2004, Pages 319-334

  Schaefer, Marcus ^a   Stefankovič, Daniel ^b,c  

^a DEPAUL UNIVERSITY   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

^c Physics and Informatics   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL GEOMETRY; DIGITAL ARITHMETIC; GRAPH THEORY; SET THEORY; THEOREM PROVING;

DECIDABILITY; STRING GRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 1842510597     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcss.2003.07.002     Document Type: Article

References (29)

1. J.F. Allen, Maintaining knowledge about temporal intervals, Comm. ACM 26 (11) (1983) 832-843.
2. S. Benzer, On the topology of the genetic fine structure, Proc. Natl. Acad. Sci. 45 (1959) 1607-1620.
3. 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, 1998, pp. 514-523.
4. H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990) 41-51.
5. G. Ehrlich, S. Even, R.E. Tarjan, Intersection graphs of curves in the plane, J. Combin. Theory 21 (1976) 8-20.
6. M.J. Egenhofer, Reasoning about binary topological relations, Lecture Notes Comput. Sci. 525 (1991) 143-160.
7. J. Flower, J. Howse, Generating euler diagrams, in: Second International Conference on Theory and Application of Diagrams, Lecture Notes in Artificial Intelligence, Vol. 2317, Springer, Berlin, 2002, pp. 61-75.
8. M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Methods 4 (3) (1983) 312-316.
9. R.L. Graham, Problem 1, in: Open Problems at 5th Hungarian Colloquium on Combinatorics, Keszthely, Hungary, 1976.
10. M. Grigni, D. Papadias, C. Papadimitriou, Topological inference, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, 1995, pp. 901-905.
11. M. Grohe, Computing crossing numbers in quadratic time, in: Proceedings of the 32nd ACM Symposium on Theory of Computing, Heraklion, Greece, July 6-8 2001, pp. 231-236.
12. W.A. Hodges, Model Theory, Cambridge University Press, Cambridge, 1993.
13. J. Kratochvíl, String graphs. I. The number of critical nonstring graphs is infinite, J. Combin. Theory Series B 52 (1991) 53-66.
14. J. Kratochvíl, String graphs. II. Recognizing string graphs is NP-hard, J. Combin. Theory Series B 52 (1991) 67-78.
15. J. Kratochvíl, Crossing number of abstract topological graphs, Lecture Notes 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. J. Kratochvíl, M. Goljan, P. Kučera, String graphs, Rozpravy Československ Akad. Věd Řada Mat. Přírod. Věd. 3 (96) (1986) 1-96.
18. O.J. Lemon, I. Pratt, Spatial logic and the complexity of diagrammatic reasoning, Mach. Graphics and Vision 6 (1) (1997) 89-108.
19. R.M. McConnell, Linear-time recognition of circular-arc graphs, in: Proceedings of the 42nd Symposium on Foundations of Computer Science, Las Vegas, October 14-17, 2001, pp. 386-394.
20. 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.
21. B. Mohar, C. Thomassen, Graphs on Surfaces, Johns Hopkins University Press, Baltimore, 2001.
22. P. Odifreddi, Classical Recursion Theory, North-Holland, Amsterdam, 1989.
23. J. Pach, G. Tóth, Which crossing number is it anyway?, J. Combin. Theory Series B 80 (2000) 225-246.
24. J. Pach, G. Tóth, Recognizing string graphs is decidable, in: P. Mutzel (Ed.), Graph Drawing 2001, Lecture Notes in Computer Science, Springer, Berlin, 2001, pp. 247-260.
25. C.H. Papadimitriou, D. Suciu, V. Vianu, Topological queries in spatial data-bases, J. Comput. System Sci. 58 (1999) 29-53.
26. M. Schaefer, E. Sedgwick, D. Štefankovič, Recognizing string graphs in NP, Technical Report TR01-011, DePaul University, October 2001.
27. W. Schnyder, Embedding planar graphs on the grid, in: D. Johnson (Ed.), Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90), San Francisco, CA, USA, SIAM, Philadelphia, January 1990, pp. 138-148.
28. F.W. Sinden, Topology of thin film circuits, Bell System Tech. J. 45 (1966) 1639-1662.
29. M. Thorup, Map graphs in polynomial time, in: IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1998, pp. 396-405.