Recognizing hole-free 4-map graphs in cubic time

被引：0
|
作者：
Chen, ZZ [1 ]
Grigni, M
Papadimitriou, CH
机构：
[1] Tokyo Denki Univ, Dept Mat Sci, Hatoyama, Saitama 3500394, Japan
[2] Emory Univ, Dept Math & Comp Sci, Atlanta, GA 30322 USA
[3] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA
来源：
ALGORITHMICA | 2006年 / 45卷 / 02期
关键词：
planar graphs; maps; map graphs; cliques; graph algorithms;
D O I：
10.1007/s00453-005-1184-8
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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.
引用
收藏
页码：227 / 262
页数：36
相关论文
共 23 条
  • [1] Recognizing Hole-Free 4-Map Graphs in Cubic Time
    Zhi-Zhong Chen
    Michelangelo Grigni
    Christos H. Papadimitriou
    [J]. Algorithmica, 2006, 45 : 227 - 262
  • [2] Characterizing and Recognizing 4-Map Graphs
    Franz J. Brandenburg
    [J]. Algorithmica, 2019, 81 : 1818 - 1843
  • [3] Characterizing and Recognizing 4-Map Graphs
    Brandenburg, Franz J.
    [J]. ALGORITHMICA, 2019, 81 (05) : 1818 - 1843
  • [4] Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
    Berry, Anne
    Brandstaedt, Andreas
    Giakoumakis, Vassilis
    Maffray, Frederic
    [J]. DISCRETE APPLIED MATHEMATICS, 2015, 184 : 50 - 61
  • [5] Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
    Brandstaedt, Andreas
    Hundt, Christian
    Nevries, Ragnar
    [J]. LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 650 - 661
  • [6] Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
    Brandstaedt, Andreas
    Giakoumakis, Vassilis
    Maffray, Frederic
    [J]. DISCRETE APPLIED MATHEMATICS, 2012, 160 (4-5) : 471 - 478
  • [7] Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations
    Alam, M. Jawaherul
    Biedl, Therese
    Felsner, Stefan
    Gerasch, Andreas
    Kaufmann, Michael
    Kobourov, Stephen G.
    [J]. ALGORITHMICA, 2013, 67 (01) : 3 - 22
  • [8] Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations
    Alam, Muhammad Jawaherul
    Biedl, Therese
    Felsner, Stefan
    Gerasch, Andreas
    Kaufmann, Michael
    Kobourov, Stephen G.
    [J]. ALGORITHMS AND COMPUTATION, 2011, 7074 : 281 - +
  • [9] Linear-Time Algorithms for Hole-free Rectilinear Proportional Contact Graph Representations
    M. Jawaherul Alam
    Therese Biedl
    Stefan Felsner
    Andreas Gerasch
    Michael Kaufmann
    Stephen G. Kobourov
    [J]. Algorithmica, 2013, 67 : 3 - 22
  • [10] RECOGNIZING P4-SPARSE GRAPHS IN LINEAR TIME
    JAMISON, B
    OLARIU, S
    [J]. SIAM JOURNAL ON COMPUTING, 1992, 21 (02) : 381 - 406
123