Recognizing hole-free 4-map graphs in cubic time

Algorithmica (New York)

Volumn 45, Issue 2, 2006, Pages 227-262

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

^a TOKYO DENKI UNIVERSITY   (Japan)

^b EMORY UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Cliques; Graph algorithms; Map graphs; Maps; Planar graphs

Indexed keywords

ALGORITHMS; MAPPING; PROBLEM SOLVING; TREES (MATHEMATICS);

CLIQUES; MAP GRAPHS; PLANAR GRAPHS;

GRAPH THEORY;

EID: 33646502596     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-005-1184-8     Document Type: Article

References (7)

1. Z.-Z. Chen. Approximation algorithms for independent sets in map graphs. J. Algorithms, 41:20-40, 2001.
2. Z.-Z. Chen, M. Grigni, and C. Papadimitriou, Planar map graphs. Proc. 30th Ann. ACM Symp. Theory of Computing (STOC), pp. 514-523, 1998.
3. Z.-Z. Chen, M. Grigni, and C. Papadimitriou. Map graphs. J. ACM, 49(2):127-138, 2002.
4. Z.-Z. Chen and M. Kouno. A linear-time algorithm for 7-coloring 1-plane graphs. Algorithmica, 43(3):147-177, 2005.
5. N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput., 14(1):210-223, 1985.
6. J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. ACM, 21(4):549-568, 1974.
7. M. Thorup. Map graphs in polynomial time. Proc. 39th Ann. IEEE Symp. Foundations of Computing (FOCS), pp. 396-105, 1998.