Map graphs

Journal of the ACM

Volumn 49, Issue 2, 2002, Pages 127-138

  Chen, Zhi Zhong ^a   Grigni, Michelangelo ^b   Papadimitriou, Christos H ^c,d  

^a TOKYO DENKI UNIVERSITY   (Japan)

^b EMORY UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Map graphs; Maps; Topological inference

Indexed keywords

EDGE; MAP GRAPHS; PLANARITY; TOPOLOGICAL INFERENCE;

ALGORITHMS; SOFTWARE ENGINEERING; TOPOLOGY;

GRAPH THEORY;

EID: 0038162916     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/506147.506148     Document Type: Article

References (18)

1. ALLEN, J. F. 1983. Maintaining knowledge about temporal intervals. Commun. ACM 26, 11 (Nov.), 832-843.
2. BORODIN, O. V. 1984. Solution of Ringel's problem on vertex-face coloring of planar graphs and coloring of 1-planar graphs. Metody Diskret. Analiz, 41, 12-26. In Russian.
3. BORODIN, O. V. 1992. Cyclic coloring of plane graphs. Discrete Math. 100, 281-289.
4. BORODIN, O. V. 1995. A new proof of the 6 color theorem. J. Graph Theory 19, 4, 507-522.
5. CHEN, Z.-Z. 2001. Approximation algorithms for independent sets in map graphs. J. Algorithms 41, 1, 20-40.
6. CHEN, Z.-Z., GRIGNI, M., AND PAPADIMITRIOU, C. 1998. Planar map graphs. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, pp. 514-523.
7. CHEN, Z.-Z., GRIGNI, M., AND PAPADIMITRIOU, C. 1999a. Map graphs. Manuscript, arXiv:cs.DM/9910013, 46 pages.
8. CHEN, Z.-Z., AND HE, X. 2000. Hierarchical topological inference on planar disc maps. In Proceedings of the 6th International Computing and Combinatorics Conference (COCOON). Springer-Verlag, Berlin, Germany, pp. 115-125.
9. CHEN, Z.-Z., HE, X., AND KAO, M.-Y. 1999b. Nonplanar topological inference and political-map graphs, In Proceedings of the 10th Annual ACM - SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, pp. 195-204.
10. EHRLICH, G., EVEN, S., AND TARJAN, R.E. 1976. Intersection graphs of curves in the plane. J. Combinat. Theory Ser. B 21, 1, 8-20.
11. GRIGNI, M., PAPADIAS, D., AND PAPADIMITRIOU, C. 1995. Topological inference. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI). IJCAI, Inc., Somerset, N.J., pp. 901-907.
12. HOPCROFT, J., AND TARJAN, R. E. 1974. Efficient planarity testing. J. ACM 21, 4 (Oct.), 549-568.
13. KRATOCHVÍL, J. 1991. String graphs II: Recognizing string graphs is NP-hard. J. Combinat. Theory Ser. B 52, 1, 67-78.
14. ORE, O., AND PLUMMER, M. D. 1969. Cyclic coloration of plane graphs. In Recent Progress in Combinatorics (Proceedings of the 3rd Waterloo Conference on Combinatorics, 1968). Academic Press, New York, pp. 287-293.
15. RENZ, J. 1998. A canonical model of the region connection calculus. In Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning. Morgan-Kaufmann, San Francisco, Calif., pp. 330-341.
16. SCHAEFER, M., SEDGWICK, E., AND ŚTEFANKOVIĆ, D. 2002. Recognizing string graphs in NP. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC). ACM, New York.
17. SCHAEFER, M., AND ŚTEFANKOVIĆ, D. 2001. Decidability of string graphs. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC). ACM, New York, pp. 241-246.
18. THORUP, M. 1998. Map graphs in polynomial time. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, Computer Society Press, Los Alamitos, Calif., pp. 396-407.