Elimination Distance to Bounded Degree on Planar Graphs Preprint

被引：0
|
作者：
Lindermayr, Alexander [1 ]
Siebertz, Sebastian [1 ]
Vigny, Alexandre [1 ]
机构：
[1] Univ Bremen, Bibliothekstr 1, D-28359 Bremen, Germany
来源：
FUNDAMENTA INFORMATICAE | 2024年 / 191卷 / 02期
关键词：
SETS;
D O I：
10.3233/FI-242175
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We study the graph parameter elimination distance to bounded degree, which was introduced by Bulian and Dawar in their study of the parameterized complexity of the graph isomorphism problem. We prove that the problem is fixed-parameter tractable on planar graphs, that is, there exists an algorithm that given a planar graph G and integers d; k decides in time f(k; d) center dot n(c) for a computable function f and constant c whether the elimination distance of G to the class of degree d graphs is at most k.
引用
收藏
页码：129 / 140
页数：12
相关论文
共 50 条
  • [21] Drawing Planar Graphs of Bounded Degree with Few Slopes
    Keszegh, Balazs
    Pach, Janos
    Palvoelgyi, Doemoetoer
    GRAPH DRAWING, 2011, 6502 : 293 - 304
  • [22] The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
    Blaeser, Markus
    Curticapean, Radu
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 96 - 107
  • [23] Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure
    Dujmovic, Vida
    Joret, Gwenael
    Micek, Piotr
    Morin, Pat
    Wood, David R.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (02):
  • [24] Filling the complexity gaps for colouring planar and bounded degree graphs
    Dabrowski, Konrad K.
    Dross, Francois
    Johnson, Matthew
    Paulusma, Daniel
    JOURNAL OF GRAPH THEORY, 2019, 92 (04) : 377 - 393
  • [25] A small universal graph for bounded-degree planar graphs
    Capalbo, MR
    PROCEEDINGS OF THE TENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1999, : 156 - 160
  • [26] Distance approximation in bounded-degree and general sparse graphs
    Marko, Sharon
    Ron, Dana
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 475 - 486
  • [27] Covering planar graphs with forests, one having bounded maximum degree
    Goncalves, D.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2009, 99 (02) : 314 - 322
  • [28] On the maximum number of edges in planar graphs of bounded degree and matching number
    Jaffke, Lars
    Lima, Paloma T.
    DISCRETE MATHEMATICS, 2023, 346 (08)
  • [29] Approximating the Distance to Properties in Bounded-Degree and General Sparse Graphs
    Marko, Sharon
    Ron, Dana
    ACM TRANSACTIONS ON ALGORITHMS, 2009, 5 (02)
  • [30] 2-Distance coloring of planar graphs with maximum degree 5
    Chen, Ming
    Jiang, Lu
    Wang, Min
    Zhou, Shan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024,
12345