A survey of parameterized algorithms and the complexity of edge modification

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, w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer science review Jg. 48; S. 100556
Hauptverfasser: Crespelle, Christophe, Drange, Pål Grønås, Fomin, Fedor V., Golovach, Petr
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 01.05.2023
Schlagworte:
Algorithms
Edge modification
Graph modification
Parameterized graph algorithms
Edge modification
Algorithms
Graph modification
Parameterized graph algorithms
ISSN:1574-0137, 1876-7745
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1574-0137
1876-7745
DOI:10.1016/j.cosrev.2023.100556