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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computer science review Ročník 48; s. 100556
Hlavní autoři:	Crespelle, Christophe, Drange, Pål Grønås, Fomin, Fedor V., Golovach, Petr
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.05.2023
Témata:	Algorithms Edge modification Graph modification Parameterized graph algorithms Edge modification Algorithms Graph modification Parameterized graph algorithms
ISSN:	1574-0137, 1876-7745
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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