A survey of parameterized algorithms and the complexity of edge modification

Crespelle, Christophe; Drange, Pål Grønås; Fomin, Fedor V.; Golovach, Petr A.

doi:10.1016/j.cosrev.2023.100556

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

2025

Publication Types

Select...

Article4

Preprint1

Book1

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 8 publications

(2 citation statements)

References 213 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We refer to ref. [1] for a comprehensive survey on this topic. Among them, the edge-deletion problem, as an important subset of graph-modification problems, has been widely studied, but most of the research is dedicated to undirected graphs.…”

Section: Introductionmentioning

confidence: 99%

An FPT Algorithm for Directed Co-Graph Edge Deletion

Li,

Yang,

et al. 2024

Algorithms

View full text Add to dashboard Cite

In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions. Firstly, we show that the problem is NP-hard. Then, we show that directed co-graphs are fully characterized by eight forbidden structures, each having, at most, six edges. Based on the symmetry properties and several refined observations, we develop a branching algorithm with a running time of O(2.733k), which is significantly more efficient compared to the brute-force algorithm, which has a running time of O(6k).

show abstract

Section: Introductionmentioning

confidence: 99%

An FPT Algorithm for Directed Co-Graph Edge Deletion

Li,

Yang,

et al. 2024

Algorithms

View full text Add to dashboard Cite

show abstract

“…More broadly, our work fits into parameterized algorithmics on graph modification problems -a line of research with a plethora of results. See Crespelle et al [6] for a recent survey focusing on edge modification problems.…”

Section: Introductionmentioning

confidence: 99%