On the induced matching problem

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 397-408

  Kanj, Iyad A ^a   Pelsmajer, Michael J ^a   Schaefer, Marcus ^b   Xia, Ge ^c  

^a DEPAUL UNIVERSITY   (United States)

^b ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^c LAFAYETTE COLLEGE   (United States)

Author keywords

Bounded genus graphs; Induced matching; Kernel; Parameterized algorithms

Indexed keywords

GRAPHIC METHODS; PARAMETER ESTIMATION;

BOUNDED-GENUS GRAPHS; GRAPH CLASS; INDUCED MATCHINGS; KERNEL; OUTERPLANAR GRAPH; PARAMETERIZED ALGORITHM; PARAMETERIZED COMPUTATION; PLANAR GRAPH;

GRAPH THEORY;

EID: 45749102482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Noga Alon. Problems and results in extremal combinatorics. I. Discrete Math., 273(1-3):31-53, 2003. EuroComb'01 (Barcelona).
2. Therese Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, and Stephen G. Kobourov. Tight bounds on maximal and maximum matchings. Discrete Math., 285(1-3):7-15, 2004.
3. Rodney G. Downey, Michael R. Fellows, and Ulrike Stege. Parameterized complexity: a framework for systematically confronting computational intractability. In Contemporary trends in discrete mathematics (Štiřín Castle, 1997), volume 49 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 49-99. Amer. Math. Soc., Providence, RI, 1999.
4. William Duckworth, David F. Manlove, and Michele Zito. On the approximability of the maximum induced matching problem. J. Discrete Algorithms, 3(1):79-91, 2005.
5. Kiyoshi Hosono. Induced forests in trees and outerplanar graphs. Proc. Fac. Sci. Tokai Univ., 25:27-29, 1990.
6. Stasys Jukna. Extremal combinatorics: With applications in computer science. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag, Berlin, 2001.
7. Richard J. Lipton and Robert Endre Tarjan. Applications of a planar separator theorem. SIAM J. Comput., 9(3):615-627, 1980.
8. Hannes Moser and Somnath Sikdar. The parameterized complexity of the induced matching problem in planar graphs. In Proceedings of the 2007 International Frontiers of Algorithmics Workshop, Lecture Notes in Comput. Sci., Berlin, 2007, to appear. Springer.
9. Hannes Moser and Dimitrios M. Thilikos. Parameterized complexity of finding regular induced sub-graphs. In Proceedings of the Second Workshop on Algorithms and Complexity in Durham, volume 7 of Texts in Algorithmics, pages 107-118. King's College, London, 2006.
10. Michael J. Pelsmajer. Maximum induced linear forests in outerplanar graphs. Graphs Combin., 20(1):121-129, 2004.
11. Mohammad R. Salavatipour. Large induced forests in triangle-free planar graphs. Graphs Combin., 22(1):113-126, 2006.
12. Douglas B. West. Open problems - strong edge coloring, http://www.math.uiuc.edu/~west/openp/strongedge.html (accessed August 11th, 2007).
13. Douglas B. West. Introduction to graph theory. Prentice Hall Inc., Upper Saddle River, NJ, 1996.
14. Michele Zito. Induced matchings in regular graphs and trees. In Graph-theoretic concepts in computer science (Ascona, 1999), volume 1665 of Lect. Notes in Comput. Science, pp. 89-100. Springer, 1999.