A direct algorithm for the parameterized face cover problem

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

Volumn 3162, Issue , 2004, Pages 213-222

  Abu Khzam, Faisal N ^a   Langston, Michael A ^b  

^a LEBANESE AMERICAN UNIVERSITY   (Lebanon)

^b University of Tennessee   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; POLYNOMIAL APPROXIMATION;

BRANCHING ALGORITHMS; BRANCHING TIME; DIRECT ALGORITHMS; FIXED-PARAMETER TRACTABILITY; KERNELIZATION; PARAMETERIZED; PLANAR DOMINATING SET; POLYNOMIAL-TIME;

PARAMETER ESTIMATION;

EID: 33750279565     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28639-4_19     Document Type: Article

References (12)

1. F. N. Abu-Khzam. Topics in Graph Algorithms: Structural Results and Algorithmic Techniqu es, with Applications. PhD thesis, Department of Computer Science, University of Tennessee, 2003.
2. J. Alber, H. L. Bodlaender, H. Fernau, T.Kloks, and R. Niedermeier. Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmic, 33(4):461-493, 2002.
3. J. Alber, H. Fan, M. R. Fellows, H. Fernau, R. Niedermeier, F. Rosamond, and U. Stege. Refined search tree technique for DOMINATING SET on planar graphs. Lecture Notes in Computer Science, 2136:111-122, 2001.
4. D. Bienstock and C. L. Monma. On the complexity of covering vertices by faces in a planar graph. SIAM J. Sci. Comput, 17:53-76, 1988.
5. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
6. M. Fellows. Private communication, 2003.
7. F. V. Fomin and D. M. Thilikos. A simple and fast approach for solving problems on planar graphs. In Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), volume 2996 of Lecture Notes in Computer Science, pages 56-67. Springer-Verlag, 2004.
8. I. A. Kanj and L. Perković. Improved parameterized algorithms for planar dominating set. In Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002), volume 2420 of Lecture Notes in Computer Science, pages 399-410. Springer-Verlag, 2002.
9. R. Niedermeier and P. Rossmanith. A general method to speed up fixed-parameter tractacle algorithms. Information Processing Letters, 73:125-129, 2000.
10. R. Niedermeier and P. Rossmanith. An efficient fixed parameter algorithm for 3-hitting set. Journal of Discrete Algorithms, 2001,
11. C. Nishizeki. Planar graphs: Theory and algorithms. Annals of Discrete Mathematics, 32, 1988.
12. K. Weihe. Covering trains by stations or the power of data reduction. In Proceedings, International Conference on Algorithms and Experiments, pages 1-8, 1998.