Access Restriction

Author Chen, Zhi-Zhong ♦ Grigni, Michelangelo ♦ Papadimitriou, Christos H.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2002
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Map graphs ♦ Maps ♦ Topological inference
Abstract We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any $\textit{point}$ of their boundaries (not necessarily an $\textit{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.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2002-03-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 49
Issue Number 2
Page Count 12
Starting Page 127
Ending Page 138

Open content in new tab

   Open content in new tab
Source: ACM Digital Library