Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms

Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structure of input graphs can help improve the time bounds. Here we present some new results based on the global structure of boundeddegree graphs after branching away the high-degree vertices. Some techniques and structural results are generic and should find more applications. First, we decompose a graph by branchings along a separator into cheap or small components where we can further branch separately. We apply this technique to accelerate the O∗

• Type: Conference
• Year: 2009
• Where: IWPEC
• Authors: Peter Damaschke
• Keywords: Applied Computing, Global Structure, IWPEC 2009, Many Parameterized Algorithms, Sophisticated Local Branching