Preprocessing for outerplanar vertex deletion: An elementary kernel of quartic size

被引：0
|
作者：
Donkers, Huib [1 ]
Jansen, Bart M.P. [1 ]
Wlodarczyk, Michal [1 ]
机构：
[1] Eindhoven University of Technology, Netherlands
来源：
Leibniz International Proceedings in Informatics, LIPIcs | 2021年 / 214卷
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graphic methods - Polynomial approximation
引用
收藏
相关论文
共 26 条
  • [21] Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion
    René van Bevern
    Hannes Moser
    Rolf Niedermeier
    Algorithmica, 2012, 62 : 930 - 950
  • [22] Preprocessing vertex-deletion problems: Characterizing graph properties by low-rank adjacencies
    Jansen B.M.P.
    de Kroon J.J.H.
    Journal of Computer and System Sciences, 2022, 126 : 59 - 79
  • [23] An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
    Kante, Mamadou Moustapha
    Kim, Eun Jung
    Kwon, O-joung
    Paul, Christophe
    ALGORITHMICA, 2017, 79 (01) : 66 - 95
  • [24] An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
    Mamadou Moustapha Kanté
    Eun Jung Kim
    O-joung Kwon
    Christophe Paul
    Algorithmica, 2017, 79 : 66 - 95
  • [25] Konig Deletion Sets and Vertex Covers above the Matching Size
    Mishra, Sounaka
    Raman, Venkatesh
    Saurabh, Saket
    Sikdar, Somnath
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 836 - +
  • [26] Approximation and Tidying-A Problem Kernel for s-Plex Cluster Vertex Deletion
    van Bevern, Rene
    Moser, Hannes
    Niedermeier, Rolf
    ALGORITHMICA, 2012, 62 (3-4) : 930 - 950
123