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.

arxiv（2020）

引用 24|浏览111

暂无评分

摘要

The survey provides an overview of the developing area of parameterized algorithms for graph modification problems. We concentrate on edge modification problems, where the task is to change a small number of adjacencies in a graph in order to satisfy some required property.

查看译文

关键词

Algorithms, Parameterized graph algorithms, Graph modification, Edge modification

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要