New algorithms for κ-face cover, κ-feedback vertex set, and κ-disjoint cycles on plane and planar graphs

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

Volumn 2573 LNCS, Issue , 2002, Pages 282-295

  Kloks, Ton ^c   Lee, C M ^a   Liu, Jiping ^b  

^a National Chung Cheng   (Taiwan)

^b UNIVERSITY OF LETHBRIDGE   (Canada)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; ALGORITHMS; TREES (MATHEMATICS);

ALGORITHM COMPUTING; DISJOINT CYCLE; FEEDBACK VERTEX SET; FEEDBACK VERTEX SET PROBLEMS; FIXED-PARAMETER ALGORITHMS; PLANE GRAPHS; PROBLEM KERNEL; TREE DECOMPOSITION;

TREES (MATHEMATICS); GRAPH THEORY;

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

References (21)

1. Alber, J., H. Bodlaender, H. Fernau, and R. Niedermeier, Faster algorithms for domination of planar graphs, Proc. of the 17th SWAT'00, Springer-Verlag LNCS 1851 (2000), pp. 97-110.
2. Alber, J., H. Fan, M. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, U. Stege, Refined search tree techniques for the planar dominating set problem, Proceedings 26th MFCS 2001.
3. Alber, Jochen, Henning Fernau, and Rolf Niedermeier, Parameterized complexity: Exponential speed-up for planar graph problems, Proceedings 28th ICALP, 2001.
4. Alber, J., H. Fernau, R. Niedermeier, Graph separators: A parameterized view, Proceedings 7th COCOON 2001.
5. Bodlaender, Hans, L., On disjoint cycles, International Journal of Foundation of Computer Science 5, (1994), pp. 59-68.
6. Bodlaender, H., A linear time algorithm for finding tree decompositions of small treewidth, SIAM J. Comput. 25, (1996), pp. 1305-1317.
7. Bodlaender, Hans L., Ton Kloks, Jochen Alber, Henning Fernau, and Rolf Niedermeier, Faster algorithms for planar dominating set and related problems, 40.Workshop Komplexitätstheorie, Datenstrukturen und Effiziente Algorithmen, Technische Universität Ilmenau, 2000.
8. Cai, Liming and D. W. Juedes, Subexponential parameterized algorithms collapse the W-hierarchy, Proceedings 28th ICALP, 2001.
9. Cai, Liming, Michael Fellows, David Juedes, and Frances Rosamond, Efficient polynomial-time approximation schemes for problems on planar structures: upper and lowerbounds. Manuscript 2001.
10. Chang M.-S, T. Kloks, and C. M. Lee, Maximum clique transversals, Proceedings 27th WG 2001, Springer-Verlag LNCS 2204 (2001), pp. 32-43.
11. Bollobás, B., Graphs without two independent circuits, (Hungarian), K. Mat. Lapok 15, (1964), pp. 311-321.
12. Diestel, R., Graph Theory, Springer-Verlag, New York, 1997.
13. Downey, Rod G. and Mike R. Fellows, Parameterized complexity, Monographs in Computer Science, Springer-Verlag, 1999.
14. Downey, R. G. and M. R. Fellows, Parameterized computational feasibility, Proceedings of feasible mathematics II (eds. P. Clote and J. B. Remmel), Birkhauser (1995), pp. 219-244.
15. Erdös, P. and L. Pósa, On independent circuits contained in a graph, Canad. J. Math. 17, (1964), pp. 347-352.
16. Fellows, M. R. and M. A. Langston, Nonconstructive tools for proving polynomial time decidability, J. ACM 35, (1988), pp. 727-739.
17. Mohar, Bojan, Face covers and the genus problem for apex graphs, Journal of Combinatorial Theory, Series B 82, (2001), pp. 102-117.
18. Telle,Jan Arne and Andrezj Proskurowski, Efficient sets in partial k-trees, Discrete Applied Math. 44, (1993), pp. 109-117.
19. Kloks, T., Treewidth-Computations and approxmations, Springer-Verlag, LNCS 842, 1994.
20. Voss, H. J., Some properties of graphs containing k independent circuits, Proc. Colloq. Tihany, Academic Press, New York, 1968, pp. 321-334.
21. Voss, H. J., Über die Taillenweite in Graphen, die maximal unabhängige Kreise enthalten, und über die Anzahl der Knotenpunkte, die alle Kreise repräsentieren, X. Internat. Wiss. Koll. TH Ilmenau 1965 Heft 11, Mathematische Probleme der Ökonomie und Rechentechnik, Vortragsreihe, 23-27.