Graph separator algorithms: A refined analysis

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

Volumn 2573 LNCS, Issue , 2002, Pages 186-197

  Fernau, Henning ^a,b  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; SEPARATORS;

DIRECT USE; FIXED-PARAMETER ALGORITHMS; GRAPH SEPARATORS; NEW APPROACHES; PLANAR SEPARATOR THEOREM; REFINED ANALYSIS; SEPARATOR THEOREMS;

SEPARATORS; ALGORITHMS;

EID: 84901396102     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_17     Document Type: Conference Paper

References (20)

1. J. Alber, M. Fellows, and R. Niedermeier. Efficient data reduction for dominating set: a linear kernel for the planar case. In M. Penttonen and E. Meineche Schmidt, editors, Algorithm Theory - SWAT 2002, volume 2368 of LNCS, pages 150-159. Springer, 2002.
2. J. Alber, H. Fernau, and R. Niedermeier. Graph separators: a parameterized view. In J. Wang, editor, Computing and Combinatorics, Proceedings COCOON 2001, volume 2108 of LNCS, pages 318-327. Springer, 2001.
3. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speedup for planar graph problems. Technical Report TR01-023, ECCC Reports, Trier, March 2001.
4. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speedup for planar graph problems. In F. Orejas, P. G. Spirakis, and J. v. Leeuwen, editors, International Colloquium on Automata, Languages and Programming ICALP 2001, volume 2076 of LNCS, pages 261-272. Springer, 2001.
5. L. Aleksandrov, H. Djidjev, H. Guo, and A. Maheshwari. Partitioning planar graphs with costs and weights. In D. M. Mount and C. Stein, editors, Algorithm Engineering and Experiments - ALENEX 2002, volume 2409 of LNCS, pages 98-110. Springer, 2002.
6. L. G. Aleksandrov and H. N. Djidjev. Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Disc. Math., 9:129-150, 1996.
7. N. Alon, P. D. Seymour, and R. Thomas. Planar separators. SIAM J. Disc. Math., 2:184-193, 1994.
8. H. L. Bodlaender. A partial κ-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209:1-45, 1998.
9. J. Chen, I. Kanj, and W. Jia. Vertex cover: Further observations and further improvements. Journal of Algorithms, 41:280-301, 2001.
10. Z.-Z. Chen. Approximation algorithms for independent sets in map graphs. Journal of Algorithms, 41:20-40, 2001.
11. Z.-Z. Chen, M. Grigni, and C. H. Papadimitriou. Map graphs. Journal of the ACM, 49:127-138, 2002.
12. H. Djidjev and S. Venkatesan. Reduced constants for simple cycle graph separation. Acta Informatica, 34:231-243, 1997.
13. H. N. Djidjev. On the problem of partitioning planar graphs. SIAM J. Algebraic Discrete Methods, 3(2):229-240, 1982.
14. H. N. Djidjev. A linear algorithm for partitioning graphs of fixed genus. Serdica, 11:369-387, 1985.
15. H. N. Djidjev. A separator theorem for graphs of fixed genus. Serdica, 11:319-329, 1985.
16. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
17. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36(2):177-189, 1979.
18. J. M. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7(3):425-440, September 1986.
19. D. A. Spielman and S.-H. Teng. Disk packings and planar separators. In SCG 96: 12th Annual ACM Symposium on Computational Geometry, pages 349-358, 1996.
20. S. M. Venkatesan. Improved constants for some separator theorems. Journal of Algorithms, 8:572-578, 1987.