A survey of parameterized algorithms and the complexity of edge modification

被引：5
|
作者：
Crespelle, Christophe [1 ]
Drange, Pal Gronas [2 ]
V. Fomin, Fedor [2 ]
Golovach, Petr [2 ]
机构：
[1] Univ Cote Azur, Nice, France
[2] Univ Bergen, Bergen, Norway
来源：
COMPUTER SCIENCE REVIEW | 2023年 / 48卷
关键词：
Algorithms; Parameterized graph algorithms; Graph modification; Edge modification; MINIMUM FILL-IN; DELETION PROBLEMS; FLIP DISTANCE; DEGREE ANONYMIZATION; COMPLETION PROBLEMS; EULERIAN EXTENSION; FPT ALGORITHM; GRAPH MINERS; PLANAR GRAPH; MULTIWAY CUT;
D O I：
10.1016/j.cosrev.2023.100556
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The survey is a comprehensive overview of the developing area of parameterized algorithms for graph modification problems. It describes state of the art in kernelization, subexponential algorithms, and parameterized complexity of graph modification. The main focus is on edge modification problems, where the task is to change some adjacencies in a graph to satisfy some required properties. To facilitate further research, we list many open problems in the area. (c) 2023 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数：31
相关论文
共 50 条
  • [1] A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
    Feldmann, Andreas Emil
    Karthik, C. S.
    Lee, Euiwoong
    Manurangsi, Pasin
    ALGORITHMS, 2020, 13 (06)
  • [2] Parameterized complexity and approximation algorithms
    Marx, Daniel
    COMPUTER JOURNAL, 2008, 51 (01): : 60 - 78
  • [3] Parameterized complexity and approximation algorithms
    Marx, Dániel
    Computer Journal, 2008, 51 (01): : 60 - 78
  • [4] On the parameterized complexity of the Edge Monitoring problem
    Baste, Julien
    Beggas, Fairouz
    Kheddouci, Hamamache
    Sau, Ignasi
    INFORMATION PROCESSING LETTERS, 2017, 121 : 39 - 44
  • [5] Parameterized Complexity of Edge Interdiction Problems
    Guo, Jiong
    Shrestha, Yash Raj
    COMPUTING AND COMBINATORICS, COCOON 2014, 2014, 8591 : 166 - 178
  • [6] Complexity and parameterized algorithms for Cograph Editing
    Liu, Yunlong
    Wang, Jianxin
    Guo, Jiong
    Chen, Jianer
    THEORETICAL COMPUTER SCIENCE, 2012, 461 : 45 - 54
  • [7] A survey on the parameterized complexity of reconfiguration problems
    Bousquet, Nicolas
    Mouawad, Amer E.
    Nishimura, Naomi
    Siebertz, Sebastian
    COMPUTER SCIENCE REVIEW, 2024, 53
  • [8] Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
    Florent Foucaud
    Hervé Hocquard
    Dimitri Lajou
    Valia Mitsou
    Théo Pierron
    Algorithmica, 2022, 84 : 1183 - 1212
  • [9] Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
    Foucaud, Florent
    Hocquard, Herve
    Lajou, Dimitri
    Mitsou, Valia
    Pierron, Theo
    ALGORITHMICA, 2022, 84 (05) : 1183 - 1212
  • [10] Parameterized Complexity of MAXIMUM EDGE COLORABLE SUBGRAPH
    Agrawal, Akanksha
    Kundu, Madhumita
    Sahu, Abhishek
    Saurabh, Saket
    Tale, Prafullkumar
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 615 - 626
12345