Genus characterizes the complexity of graph problems: some tight results

  • Authors:

  • Jianer Chen;Iyad A. Kanj;Ljubomir Perković;Eric Sedgwick;Ge Xia

  • Affiliations:

  • Department of Computer Science, Texas A&M University, College Station, TX;School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, IL;School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, IL;School of Computer Science, Telecommunications and Information Systems, DePaul University, Chicago, IL;Department of Computer Science, Texas A&M University, College Station, TX

  • Venue:
  • ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

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).