adjacency
maps
article
Hole-Free 4-Map Graphs
algorithm
holes
https://scigraph.springernature.com/explorer/license/
time
problem
2006-02-10
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.
adjacencies of countries
graph
2022-01-01T18:16
countries
2006-02-10
cubic-time algorithm
true
cubic time
point
227-262
simple graph
articles
en
Recognizing Hole-Free 4-Map Graphs in Cubic Time
https://doi.org/10.1007/s00453-005-1184-8
0178-4617
Algorithmica
1432-0541
Springer Nature
45
Chen
Zhi-Zhong
Springer Nature - SN SciGraph project
Papadimitriou
Christos H.
Michelangelo
Grigni
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA
Department of Mathematics and Computer Science, Emory University, Atlanta, GA 30322, USA
doi
10.1007/s00453-005-1184-8
dimensions_id
pub.1048829130
Computer Science Division, University of California at Berkeley, Berkeley, CA 94720, USA
Computer Science Division, University of California at Berkeley, Berkeley, CA 94720, USA
Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan
Department of Mathematical Sciences, Tokyo Denki University, Hatoyama, Saitama 350-0394, Japan
2