Vis enkel innførsel

A survey of parameterized algorithms and the complexity of edge modification

dc.contributor.authorCrespelle, Christophe
dc.contributor.authorDrange, Pål Grønås
dc.contributor.authorFomin, Fedor
dc.contributor.authorGolovach, Petr
dc.date.accessioned2023-05-08T08:39:43Z
dc.date.available2023-05-08T08:39:43Z
dc.date.created2023-05-05T14:09:32Z
dc.date.issued2023
dc.identifier.issn1574-0137
dc.identifier.urihttps://hdl.handle.net/11250/3066699
dc.description.abstractThe 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.en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleA survey of parameterized algorithms and the complexity of edge modificationen_US
dc.typeJournal articleen_US
dc.typePeer revieweden_US
dc.description.versionpublishedVersionen_US
dc.rights.holderCopyright 2023 The Author(s)en_US
dc.source.articlenumber100556en_US
cristin.ispublishedtrue
cristin.fulltextoriginal
cristin.qualitycode1
dc.identifier.doi10.1016/j.cosrev.2023.100556
dc.identifier.cristin2145853
dc.source.journalComputer Science Reviewen_US
dc.identifier.citationComputer Science Review. 2023, 48, 100556.en_US
dc.source.volume48en_US


Tilhørende fil(er)

Thumbnail
Filnavn:
1-s2.0-S1574013723000230-main.pdf
Størrelse:
739.6Kb
Format:
PDF
Beskrivelse:
PDF
Åpne

Denne innførselen finnes i følgende samling(er)

Vis enkel innførsel

Navngivelse 4.0 Internasjonal
Med mindre annet er angitt, så er denne innførselen lisensiert som Navngivelse 4.0 Internasjonal