Map graphs in polynomial time

被引：26
|
作者：
Thorup, M [1 ]
机构：
[1] Univ Copenhagen, Dept Comp Sci, DK-2100 Copenhagen, Denmark
来源：
39TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 1998年
关键词：
D O I：
10.1109/SFCS.1998.743490
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Chen, Grigni. ct,ln Papadimitriou (WADS'97 and STOC'98) have introduced a modified notion of planarity, where two faces are considered adjacent if they share at least one point. The corresponding abstract graphs are called map graphs. Chen et.al. raised the question of whether map graphs can he recognized in polynomial rime. They showed that the decision problem is in NP and presented a polynomial time algorithm for the special case where we allow at most 4 faces to intersect in any point - if only 3 are allowed to intersect in a point, we get the usual planar graphs. Chen et.al. conjectured that map graphs can be recognized in polynomial rime. and in this paper, their conjecture is settled affirmatively.
引用
收藏
页码：396 / 405
页数：2
相关论文
共 50 条
  • [1] Ramanujan Graphs in Polynomial Time
    Cohen, Michael B.
    [J]. 2016 IEEE 57TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2016, : 276 - 281
  • [2] Capturing Polynomial Time on Interval Graphs
    Laubner, Bastian
    [J]. 25TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2010), 2010, : 199 - 208
  • [3] Recognizing hyperelliptic graphs in polynomial time
    Bodewes, Jelco M.
    Bodlaender, Hans L.
    Cornelissen, Gunther
    van der Wegen, Marieke
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 815 : 121 - 146
  • [4] Contractions of Planar Graphs in Polynomial Time
    Kaminski, Marcin
    Paulusma, Daniel
    Thilikos, Dimitrios M.
    [J]. ALGORITHMS-ESA 2010, 2010, 6346 : 122 - +
  • [5] Hyperbolic intersection graphs and (quasi)-polynomial time
    Kisfaludi-Bak, Sandor
    [J]. PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1621 - 1638
  • [6] Hyperbolic intersection graphs and (quasi)-polynomial time
    Kisfaludi-Bak, Sandor
    [J]. PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1621 - 1638
  • [7] Factoring cardinal product graphs in polynomial time
    Imrich, W
    [J]. DISCRETE MATHEMATICS, 1998, 192 (1-3) : 119 - 144
  • [8] RECOGNIZING CIRCLE GRAPHS IN POLYNOMIAL-TIME
    GABOR, CP
    SUPOWIT, KJ
    HSU, WL
    [J]. JOURNAL OF THE ACM, 1989, 36 (03) : 435 - 473
  • [9] Colouring random graphs in expected polynomial time
    Coja-Oghlan, A
    Taraz, A
    [J]. STACS 2003, PROCEEDINGS, 2003, 2607 : 487 - 498
  • [10] Bandwidth of bipartite permutation graphs in polynomial time
    Heggernes, Pinar
    Kratsch, Dieter
    Meister, Daniel
    [J]. LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 216 - +
12345