On Feedback Vertex Set New Measure and New Structures

  • Yixin Cao
  • Jianer Chen
  • Yang Liu
Conference paper

DOI: 10.1007/978-3-642-13731-0_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6139)
Cite this paper as:
Cao Y., Chen J., Liu Y. (2010) On Feedback Vertex Set New Measure and New Structures. In: Kaplan H. (eds) Algorithm Theory - SWAT 2010. SWAT 2010. Lecture Notes in Computer Science, vol 6139. Springer, Berlin, Heidelberg

Abstract

We study the parameterized complexity of the feedback vertex set problem (fvs) on undirected graphs. We approach the problem by considering a variation of it, the disjoint feedback vertex set problem (disjoint-fvs), which finds a disjoint feedback vertex set of size k when a feedback vertex set of a graph is given. We show that disjoint-fvs admits a small kernel, and can be solved in polynomial time when the graph has a special structure that is closely related to the maximum genus of the graph. We then propose a simple branch-and-search process on disjoint-fvs, and introduce a new branch-and-search measure. The branch-and-search process effectively reduces a given graph to a graph with the special structure, and the new measure more precisely evaluates the efficiency of the branch-and-search process. These algorithmic, combinatorial, and topological structural studies enable us to develop an O(3.83kkn2) time parameterized algorithm for the general fvs problem, improving the previous best algorithm of time O(5kkn2) for the problem.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yixin Cao
    • 1
  • Jianer Chen
    • 1
  • Yang Liu
    • 2
  1. 1.Department of Computer Science and EngineeringTexas A&M University 
  2. 2.Department of Computer ScienceUniversity of Texas - Pan American 

Personalised recommendations