New results on induced matchings

Discrete Applied Mathematics

Volumn 101, Issue 1-3, 2000, Pages 157-165

  Golumbic, Martin Charles ^a   Lewenstein, Moshe ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Design and analysis of algorithms; Graph theory; Induced matchings; Matchings; Perfect graphs; Strong matchings

Indexed keywords

EID: 0000369268     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00194-8     Document Type: Article

References (17)

1. Booth K.S., Lueker G.S. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Systems Sci. 13:1976;335-379.
2. Cameron K. Induced matchings. Discrete Appl. Math. 24:1989;97-102.
3. D.G. Corneil, S. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? Proceedings of the Ninth Symposium on Discrete Algorithms (SODA), 1998, pp. 175-180.
4. Dagan I., Golumbic M.C., Pinter R. Trapezoid graphs and their colorings. Discrete Appl. Math. 21:1988;35-46.
5. Felsner S., Müller R., Wernisch L. Trapezoid graphs and generalizations, geometry and algorithms. Discrete Appl. Math. 74(1):1997;13-32.
6. Fricke G., Laskar R. Strong matchings on trees. Congr. Numer. 89:1992;239-243.
7. Gavril F. Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph. SIAM J. Comput. 1:1972;180-187.
8. Gilmore P.C., Hoffman A.J. A characterization of comparability graphs and of interval graphs. Canad. J. Math. 16:1964;539-548.
9. Golumbic M.C. Comparability graphs and a new matroid. J. Combin. Theory B. 22:1977;68-90.
10. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
11. Golumbic M.C., Hammer P.L. Stability in circular arc graphs. J. Algorithm. 9:1988;314-320.
12. Golumbic M.C., Laskar R.C. Irredundancy in circular arc graphs. Discrete Appl. Math. 44:1993;79-89.
13. Gupta U.I., Lee D.T., Leung J.Y.T. Efficient algorithms for interval graphs and circular-arc graphs. Networks. 12:1982;459-467.
14. Hsiao J.Y., Tang C.Y., Chang R.S. An efficient algorithm for finding a maximum weight two-independent set on interval graphs. Inform. Process. Lett. 43(5):1992;229-235.
15. Hsu W.L., Tsai K.H. Linear time algorithms on circular-arc graphs. Inform. Process. Lett. 40:1991;123-129.
16. C.W. Ko, F.B. Shepherd, Adding an identity to a totally unimodular matrix, LSE Operations Research Working Paper LSEOR.94.14, 1994.
17. Lee D.T., Sarrafzadeh M., Wu Y.F. Minimum cuts for circular-arc graphs. SIAM J. Comput. 19(6):1990;1041-1050.