Map graphs

Authors:
Zhi-Zhong Chen;Michelangelo Grigni;Christos H. Papadimitriou
Affiliations:
Tokyo Denki University, Hatoyama, Saitama, Japan;Emory University, Atlanta, Georgia;University of California, Berkeley, Berkeley, California
Venue:
Journal of the ACM (JACM)
Year:
2002

Citing 12
Cited 8

String graphs. II.: Recognizing string graphs is NP-hard

Journal of Combinatorial Theory Series B
Cyclic coloring of plane graphs

Discrete Mathematics - Special volume (part 1) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs”
A new proof of the 6 color theorem

Journal of Graph Theory
Planar map graphs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Nonplanar topological inference and political-map graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Planarity Testing

Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals

Communications of the ACM
Decidability of string graphs

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Recognizing string graphs in NP

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximation algorithms for independent sets in map graphs

Journal of Algorithms
Map Graphs In Polynomial Time

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Topological inference

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1

Graph Separator Algorithms: A Refined Analysis

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph separators: a parameterized view

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

ACM Transactions on Algorithms (TALG)
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Bidimensionality and geometric graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth

GD'04 Proceedings of the 12th international conference on Graph Drawing
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give an NP characterization for such graphs, derive some consequences regarding sparsity and coloring, and survey some algorithmic results.