A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Structural Parameterizations with Modulator Oblivion
[article]
2020
arXiv
pre-print
It is known that problems like Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal are polynomial time solvable in the class of chordal graphs. We consider these problems in a graph that has at most k vertices whose deletion results in a chordal graph, when parameterized by k. While this investigation fits naturally into the recent trend of what are called 'structural parameterizations', here we assume that the deletion set is not given. One method to solve them is to compute a k-sized
arXiv:2002.09972v1
fatcat:m5rmbaghtjfwfgnvmftp2kq4o4