Recognizing Hole-Free 4-Map Graphs in Cubic Time

We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at most four countries meet at any point. Key words. planar graphs, maps, map graphs, cliques, graph algorithms.

• Type: Journal
• Year: 2006
• Where: ALGORITHMICA
• Authors: Zhi-Zhong Chen, Michelangelo Grigni, Christos H. Papadimitriou
• Keywords: ALGORITHMICA 2006, Cubic-time Algorithm, Key Words, Simple Graph