Recognizing string graphs is decidable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2265 LNCS, Issue , 2002, Pages 247-260

  Pach, János ^a   Toth, Geza ^a  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); RECURSIVE FUNCTIONS;

CORRESPONDING VERTICES; STRING GRAPHS;

GRAPH THEORY;

EID: 84867449585     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45848-4_20     Document Type: Conference Paper

References (29)

1. S. Benzer: On the topology of the genetic fine structure, Proceedings of the National Academy of Sciences of the United States of America 45 (1959), 1607-1620.
2. Z.-Z. Chen, M. Grigni, and C. H. Papadimitriou, Planar map graphs, in: STOC '98, ACM, 1998, 514-523.
3. Z.-Z. Chen, M. Grigni, and C. H. Papadimitriou, Planar topological inference, (Japanese)in: Algorithms and Theory of Computing (Kyoto, 1998) Surikaisekikenkyusho Kokyuroku 1041 (1998), 1-8.
4. Z.-Z. Chen, X. He, and M.-Y. Kao, Nonplanar topological inference and political-map graphs, in: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 1999), ACM, New York, 1999, 195-204.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing, Prentice Hall, Upper Saddle River, NJ, 1999.
6. M. Egenhofer, A model for detailed binary topological relationships, Geomatica 47 (1993), 261-273.
7. M. Egenhofer and R. Franzosa, Point-set topological spatial relations, International Journal of Geographical Information Systems 5 (1991), 161-174.
8. M. Egenhofer and J. Sharma, Assessing the consistency of complete and incomplete topological information, Geographical Systems 1 (1993), 47-68.
9. G. Ehrlich, S. Even, and R. E. Tarjan, Intersection graphs of curves in the plane, Journal of Combinatorial Theory, Series B 21 (1976), 8-20.
10. P. Erdos, A. Hajnal, and J. Pach, A Ramsey-type theorem for bipartite graphs, Geombinatorics 10 (2000), 64-68.
11. S. Even, A. Pnueli, and A. Lempel, Permutation graphs and Transitive graphs, Journal of Association for Computing Machinery 19 (1972), 400-411.
12. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
13. R. L. Graham: Problem, in: Combinatorics, Vol. II (A. Hajnal and V. T. S ós, eds.), North-Holland Publishing Company, Amsterdam, 1978, 1195.
14. J. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. ACM 21 (1974), 549-568.
15. J. Kratochvíl, String graphs, in: Graphs and Other Combinatorial Topics (Prague, 1982), Teubner-Texte Math. 59, Teubner, Leipzig, 1983, 168-172.
16. J. Kratochvíl, String graphs I: The number of critical nonstring graphs is infinite, Journal of Combinatorial Theory, Series B 52 (1991), 53-66.
17. J. Kratochvíl, String graphs II: Recognizing string graphs is NP-hard, Journal of Combinatorial Theory, Series B 52 (1991), 67-78.
18. J. Kratochvíl, Crossing number of abstract topological graphs, in: Graph drawing (Montreal, QC, 1998), Lecture Notes in Comput. Sci. 1547, Springer, Berlin, 1998, 238-245.
19. J. Kratochvíl, A. Lubiw, and J. Nešetřil, Noncrossing subgraphs in topological layouts, SIAM J. Discrete Math. 4 (1991), 223-244.
20. J. Kratochvíl and J. Matoušek, NP-hardness results for intersection graphs, Comment. Math. Univ. Carolin. 30 (1989), 761-773.
21. J. Kratochvíl and J. Matoušek, String graphs requiring exponential representations, Journal of Combinatorial Theory, Series B 53 (1991), 1-4.
22. J. Kratochvíl and J. Matoušek, Intersection graphs of segments, Journal of Combinatorial Theory, Series B 62 (1994), 289-315.
23. N. Linial, E. London, and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combinatorica 15 (1995), 215-245.
24. M. Middendorf and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs, in: Graph Theory and Combinatorics (Marseille-Luminy, 1990), Discrete Math. 111 (1993), 393-400.
25. J. Pach and J. Solymosi, Crossing patterns of segments, Journal of Combinatorial Theory, Ser. A, to appear.
26. S. Rao, Small distortion and volume preserving embeddings for planar and Euclidean metrics, in: Proceedings of the Fifteenth Annual Symposium on Computational Geometry (Miami Beach, FL, 1999), ACM, New York, 1999, 300-306.
27. M. Schaefer and D. Stefankovič, Decidability of string graphs, STOC 01, to appear.
28. F. W. Sinden, Topology of thin film RC circuits, Bell System Technological Journal (1966), 1639-1662.
29. T. R. Smith and K. K. Park, Algebraic approach to spatial reasoning, International Journal of Geographical Information Systems 6 (1992), 177-192.