Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Creat membership Creat membership
Sign in

Forgot password?

Confirm
  • Forgot password?
    Sign Up
  • Confirm
    Sign In
Collection
For ¥0.57 per day, unlimited downloads CREATE MEMBERSHIP Download

toTop

If you have any feedback, Please follow the official account to submit feedback.

Turn on your phone and scan

home > search >

A Linear Kernel for the k -Disjoint Cycle Problem on Planar Graphs

Author:
Hans L. Bodlaender, Eelko Penninkx  Richard B. Tan  


Journal:
Lecture Notes in Computer Science


Issue Date:
2008


Abstract(summary):

We consider the following problem: given a planar graph G = (V,E) and integer k, find if possible at least k vertex disjoint cycles in G. This problem is known to be NP-complete. In this paper, we give a number of simple data reduction rules. Each rule transforms the input to an equivalent smaller input, and can be carried out in polynomial time. We show that inputs on which no rule can be carried out have size linear in k. Thereby we obtain that the k -Disjoint Cycles problem on planar graphs has a kernel of linear size. We also present a parameterized algorithm with a running time of O(c脰k + n2)O(c^{\sqrt{k}} + n^2).


Page:
306-317


VIEW PDF

The preview is over

If you wish to continue, please create your membership or download this.

Create Membership

Similar Literature

Submit Feedback

This function is a member function, members do not limit the number of downloads