A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
2020
European Symposium on Algorithms
We study algorithmic properties of the graph class Chordal-ke, that is, graphs that can be turned into a chordal graph by adding at most k edges or, equivalently, the class of graphs of fill-in at most k. We discover that a number of fundamental intractable optimization problems being parameterized by k admit subexponential algorithms on graphs from Chordal-ke. While various parameterized algorithms on graphs for many structural parameters like vertex cover or treewidth can be found in the
doi:10.4230/lipics.esa.2020.49
dblp:conf/esa/FominG20a
fatcat:dh4jo3kb5rc3xgw7rqfted5doi