Linear Kernels on Graphs Excluding Topological Minors

Details Linear Kernels on Graphs Excluding Topological Minors Linear Kernels on Graphs Excluding Topological Minors

2012-01-13

arxiv.org/abs/1201.2780v3

Computer Science

Data Structures and Algorithms

19 pages

Scientific paper

We show that problems which have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of $H$-topological-minor free graphs, for an arbitrary fixed graph $H$. This builds on earlier results by Fomin et al.\ on linear kernels for $H$-minor-free graphs and by Bodlaender et al.\ on graphs of bounded genus. Our framework encompasses several problems, the prominent ones being Chordal Vertex Deletion, Feedback Vertex Set and Edge Dominating Set.

Affiliated with

Also associated with

No associations

Rating

Linear Kernels on Graphs Excluding Topological Minors does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear Kernels on Graphs Excluding Topological Minors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Kernels on Graphs Excluding Topological Minors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-471185