Genus Characterizes the Complexity of Graph Problems: Some Tight Results

We study the fixed-parameter tractability, subexponential time computability, and approximability of the well-known NP-hard problems: Independent Set, Vertex Cover, and Dominating Set. We derive tight results and show that the computational complexity of these problems, with respect to the above complexity measures, is dependent on the genus of the underlying graph. For instance, we show that, under the widely-believed complexity assumption W[1] ≠ FPT, INDEPENDENT SET on graphs of genus bounded by g1(n) is fixed parameter tractable if and only if g1(n) = o(n2), and DOMINATING SET on graphs of genus bounded by g2(n) is fixed parameter tractable if and only if g2(n) = no(1). Under the assumption that not all SNP problems are solvable in subexponential time, we show that the above three problems on graphs of genus bounded by g3(n) are solvable in subexponential time if and only if g3(n) = o(n).

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

[2]  Hristo Djidjev,et al.  Planarization of Graphs Embedded on Surfaces , 1995, WG.

[3]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[4]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[5]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[6]  Liming Cai,et al.  On the existence of subexponential parameterized algorithms , 2003, J. Comput. Syst. Sci..

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

[8]  Rolf Niedermeier,et al.  Refined Search Tree Technique for DOMINATING SET on Planar Graphs , 2001, MFCS.

[9]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[13]  Jianer Chen.  Algorithmic Graph Embeddings , 1997, Theor. Comput. Sci..

[14]  Michael R. Fellows,et al.  The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus , 2002, SWAT.

[15]  Jianer Chen,et al.  A Note on Approximating Graph Genus , 1997, Inf. Process. Lett..

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

[17]  Russell Impagliazzo,et al.  Which Problems Have Strongly Exponential Complexity? , 2001, J. Comput. Syst. Sci..

[18]  Carsten Thomassen,et al.  The Graph Genus Problem is NP-Complete , 1989, J. Algorithms.

[19]  Carsten Lund,et al.  Proof verification and the hardness of approximation problems , 1998, JACM.

[20]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.