Genus characterizes the complexity of graph problems: Some tight results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 845-856

  Chen, Jianer ^a   Kanj, Iyad A ^b   Perković, Ljubomir ^b   Sedgwick, Eric ^b   Xia, Ge ^a  

^a TEXAS A AND M UNIVERSITY   (United States)

^b DEPAUL UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

APPROXIMABILITY; COMPLEXITY ASSUMPTIONS; COMPLEXITY MEASURES; DOMINATING SETS; FIXED-PARAMETER TRACTABILITY; INDEPENDENT SET; SUBEXPONENTIAL TIME; UNDERLYING GRAPHS;

PROBLEM SOLVING;

EID: 34250190430     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_66     Document Type: Article

References (18)

1. J. ALBER, H. FAN, M. FELLOWS, H. FERNAU, R. NIEDERMEIER, F. ROSAMOND, AND U. STEGE, Refined search tree technique for dominating set on planar graphs, LNCS 2136, (2001), pp. 111-122.
2. J. ALBER, H. FERNAU, AND R. NIEDERMEIER, Parameterized complexity: exponential speedup for planar graph problems, LNCS 2076, (2001), pp. 261-272.
3. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and hardness of approximation problems, J. ACM 45, (1998), pp. 501-555.
4. G. AUSIELLO, P. CRESCENZI, G. GAMBOSI, V. KANN, A. MARCHETTI-SPACCAMELA, AND M. PROTASI, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer-Verlag, Berlin Heidelberg, 1999.
5. B. BAKER, Approximation algorithms for NP-complete problems on planar graphs, J. ACM 41, (1994), pp. 153-180.
6. L. CAI AND D. JUEDES, On the existence of subexponential-time parameterized algorithms, JCSS, to appear.
7. J. CHEN, Algorithmic graph embeddings, TCS 181, (1987), pp. 247-266.
8. J. CHEN, S. KANCHI, AND A. KANEVSKY, A note on approximating graph genus, Information Processing Letters 61, (1997), pp. 317-322.
9. J. CHEN, I. KANJ, AND W. JIA, Vertex cover: further observations and further improvements, J. Algorithms 41, (2001), pp. 280-301.
10. H. DJIDJEV AND S. VENKATESAN, Planarization of graphs embedded on surfaces, LNCS 1017 (WG'95), (1995), pp. 62-72.
11. R. DOWNEY AND M. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
12. J. ELLIS, H. FAN, AND M. FELLOWS, The dominating set problem is fixed parameter tractable for graphs of bounded genus, LNCS 2368, (2002), pp. 180-189.
13. M. GAREY AND D. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
14. J. GROSS AND T. TUCKER, Topological Graph Theory, Wiley-Interscience, New York, 1987.
15. R. IMPAGLIAZZO, R. PATURI, AND F. ZANE, Which problems have strongly exponential complexity? JCSS 63, (2001), pp. 512-530.
16. R. LIPTON AND R. TARJAN, Applications of a planar separator theorem, SIAM Journal on Computing 9, (1980), pp. 615-627.
17. C. PAPADIMITRIOU AND M. YANNAKAKIS, Optimization, approximation and complexity classes, JCSS 43, (1991), pp. 425-440.
18. C. THOMASSEN, The graph genus problem is NP-complete, J. Algorithms 10, (1989), pp. 568-576.