A survey of parameterized algorithms and the complexity of edge modification
January 19, 2020 Β· The Cartographer Β· π Computer Science Review
"No code URL or promise found in abstract"
"Title-pattern auto-detect: A survey of parameterized algorithms and the complexity of edge modification"
Evidence collected by the PWNC Scanner
Authors
Christophe Crespelle, PΓ₯l GrΓΈnΓ₯s Drange, Fedor V. Fomin, Petr A. Golovach
arXiv ID
2001.06867
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.CC
Citations
58
Venue
Computer Science Review
Last Checked
1 day ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
π
π
The Cartographer
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer