Graph Separator Algorithms: A Refined Analysis

This paper continues our research on the use of graph separator theorems for designing fixed parameter algorithms started with the COCOON'01 contribution [2], showing how a more elaborated use of these theorems can bring down the algorithmically relevant constants. More precisely, if a c?k-algorithm is obtainable with the help of applying the well-known Lipton/Tarjan planar separator theorem, our new approach will lead to a c2/3?k-algorithm, this way also improving on the direct use of the "best" known planar separator theorem. For several problems, the constants can be even improved more by analyzing other separator theorems.

[1]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[2]  Zhi-Zhong Chen,et al.  Approximation Algorithms for Independent Sets in Map Graphs , 2000, J. Algorithms.

[3]  Rolf Niedermeier,et al.  Parameterized complexity: exponential speed-up for planar graph problems , 2001, J. Algorithms.

[4]  Hristo Djidjev,et al.  Reduced constants for simple cycle graph separation , 1997, Acta Informatica.

[5]  Rolf Niedermeier,et al.  Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case , 2002, SWAT.

[6]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[7]  Shang-Hua Teng,et al.  Disk packings and planar separators , 1996, SCG '96.

[8]  Rolf Niedermeier,et al.  Graph Separators: A Parameterized View , 2001, COCOON.

[9]  Shankar M. Venkatesan.  Improved Constants for Some Separator Theorems , 1987, J. Algorithms.

[10]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[11]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[12]  Martti Penttonen,et al.  Algorithm Theory — SWAT 2002 , 2002, Lecture Notes in Computer Science.

[13]  Hans L. Bodlaender,et al.  A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..

[14]  Hristo Djidjev,et al.  Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus , 1996, SIAM J. Discret. Math..

[15]  Robin Thomas,et al.  Planar Separators , 1994, SIAM J. Discret. Math..

[16]  Hristo Djidjev,et al.  Partitioning Planar Graphs with Costs and Weights , 2002, ALENEX.

[17]  H. Djidjev.  On the Problem of Partitioning Planar Graphs , 1982 .

[18]  Zhi-Zhong Chen,et al.  Map graphs , 1999, JACM.