Tighter approximations for maximum induced matchings in regular graphs

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

Volumn 3879 LNCS, Issue , 2006, Pages 270-281

  Gotthilf, Zvi ^a   Lewenstein, Moshe ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION FACTOR; COMBINATORIAL OBJECTS; GREEDY ALGORITHMS; MAXIMUM INDUCED MATCHINGS;

ALGORITHMS; COMBINATORIAL MATHEMATICS; DATA REDUCTION; GRAPH THEORY; PROBLEM SOLVING;

APPROXIMATION THEORY;

EID: 33745604312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11671411_21     Document Type: Conference Paper

References (14)

1. K. Cameron. Induced matchings. Discrete Applied Mathematics, 24:97-102, 1989.
2. K. Cameron. Induced matchings in intersection graphs. Proceedings of the Sixth International Conference on Graph Theory, Marseille, France, August, 2000.
3. W. Duckworth, D. Manlove and M. Zito. On the approximability of the maximum induced matching problem. Journal of Discrete Algorithms, 3(1):79-91, 2005.
4. P. Erdos. Problems and results in combinatorial analysis and graph theory. Discrete Mathematics, 72:81-92, 1988.
5. R.J. Faudree, A. Gyarfas, R.H. Schelp and Z. Tuza. Induced matchings in bipartite graphs. Discrete Mathematics, 78:83-87, 1989.
6. G. Fricke and R. Lasker. Strong matchings in trees. Congressus Numerantium, 89:239-244, 1992.
7. M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.
8. M.C. Golumbic and R.C. Laskar. Irredundancy in circular arc graphs. Discrete Applied Mathematics, 44:79-89, 1993.
9. M.C. Golumbic and and M. Lewenstein. New results on induced matchings. Discrete Applied Mathematics, 101:157-165, 2000.
10. P. Horak, H.Qing and W.T. Trotter. Induced matchings in cubic graphs. Journal of Graph Theory, 17(2):151-160, 1993.
11. C.W. Ko and F.B. Shepherd. Adding an identity to a totally unimodular matrix. Working paper LSEOR.94.14, London School of Economics, Operational Research Group, 1994.
12. A. Steger and M. Yu. On induced matchings. Discrete Mathematics, 120:291-295, 1993.
13. L. J. Stockmeyer and V.V. Vazirani. NP-completeness of some generalization of the maximum matching problem. Information Processing Letters, 15(1):14-19, 1982.
14. M. Zito. Induced matchings in regular graphs and trees. Proc. of WG 1999, LNCS 1665, 89-100, 1999.