Finding maximum induced matchings in subclasses of claw-free and P5-free graphs, and in graphs with matching and induced matching of equal maximum size1

Algorithmica (New York)

Volumn 37, Issue 4, 2003, Pages 327-346

  Kobler, Daniel ^a   Rotics, Udi ^b  

^a Tm Bioscience Corporation   (Canada)

^b NETANYA ACADEMIC COLLEGE   (Israel)

Author keywords

(Bull, chair) free graphs; Claw free graphs; Induced matching; Line graphs; Polynomial algorithms; r Regular graphs

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; HAMILTONIANS; OPTIMIZATION; POLYNOMIALS; THEOREM PROVING;

BULL CHAIR FREE GRAPHS; CLAW FREE GRAPHS; GRAPH MATCHING; LINE GRAPHS; MAXIMUM INDUCED MATCHING; POLYNOMIAL ALGORITHMS; REGULAR GRAPHS;

GRAPH THEORY;

EID: 0344981397     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-003-1035-4     Document Type: Article

References (33)

1. V.E. Alekseev, On the number of maximal independent sets in graphs from hereditary classes, in Combinatorial-Algebraic Methods in Discrete Optimization, NNSU Publishers, Nizhny Novgorod University, 1991, pp. 5-8 (in Russian).
2. 5, diamond)-free graphs revisited: structure bounded clique-width and linear time optimization, to appear in Discrete Appl. Math.
3. A. Brandstädt, F.F. Dragan and E. Köhler, Linear time algorithms for Hamiltonian problems on (claw, net)-free graphs, SIAM J. Comput. 30, (2000), 1662-1677.
4. A. Brandstädt, F.F. Dragan, H.-O. Le and R. Mosca, New graph classes of bounded clique-width, Proc. WG 2002, Lecture Notes in Computer Science 2573, Springer-Verlag, Berlin, 2002, pp. 57-67.
5. A. Brandstädt, C.T. Hoàng and V.B. Le, Stability number of bull- and chair-free graphs revisited, to appear in Discrete Appl. Math.
6. 5, gem)-free graphs have bounded clique-width, Technical Report, 2002.
7. 5- and co-chair-free graphs, to appear in Discrete Appl. Math.
8. H. Buer and R.H. Möhring. A fast algorithm for the decomposition of graphs and posets, Math. Oper. Res. 8(2) (1983), 170-184.
9. K. Cameron, Induced matchings, Discrete Appl. Math. 24 (1989), 97-102.
10. K. Cameron, Induced matchings in intersection graphs (extended abstract), Electron. Notes Discrete Math. 5 (2000).
11. K. Cameron, R. Sritharan and Y. Tang, Finding a maximum induced matching in weakly chordal graphs, Discrete Math. 266 (2003), 133-142.
12. D.G. Corneil, Y. Perl and L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput. 14 (1985), 926-934.
13. B. Courcelle, J.A. Makowsky and U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Systems 33 (2000), 125-150.
14. A. Cournier and M. Habib, A new linear algorithm for modular decomposition, in T. Sophie (editor) Trees in algebra and programming, CAAP '94, Lecture Notes in Computer Science 787, Springer-Verlag, Berlin, 1994, pp. 68-84.
15. E. Dahlhaus, J. Gustedt, and R.M. McConnell, Efficient and practical modular decomposition, Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1997, pp. 26-35.
16. D. Duffus, M.S. Jacobson and R.J. Gould, Forbidden subgraphs and the Hamiltonian theme, Proc. 4th Internat. Conf. Theory and Applications of Graphs, Kalamazoo, MI, 1980, Wiley, New York, 1981, pp. 297-316.
17. J. Edmonds, Paths, trees, and flowers, Canad. J. Math. 17 (1965), 449-467.
18. G.H. Fricke, S.T. Hedetniemi and D.P. Jacobs, Independence and irredundance in k-regular graphs, Ars Combin. 49 (1998), 271-279.
19. M.R. Garey and D.S. Johnson, Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman, San Francisco, CA, 1979.
20. 5-free graphs, Discrete Appl. Math. 125 (2003), 215-224.
21. M.C. Golumbic and M. Lewenstein, New results on induced matchings, Discrete Appl. Math. 101 (2000), 157-165.
22. D.G. Kirkpatrick and P. Hell, On the completeness of a generalized matching problem, Proc. Tenth Annual ACM Symp. on Theory and Computing, 1978, pp. 240-245.
23. D.G. Kirkpatrick and P. Hell, On the complexity of general graph factor problems, SIAM J. Comput. 12 (1983), 601-609.
24. C.W. Ko and F.B. Shepherd, Adding an identity to a totally unimodular matrix, LSEO Operations Research Working Paper LSEOR.94.14, 1994.
25. P.G.H. Lehot, An optimal algorithm to detect a line graph and output its root graph, J. Assoc. Comput. Mach. 21 (1974), 569-575.
26. V.V. Lozin, On maximum induced matchings in bipartite graphs, Inform. Process. Lett. 81(1) (2002), 7-11.
27. R.M. McConnell and J. Spinrad, Modular decomposition and transitive orientation, Discrete Math. 201 (1999), 189-241.
28. S. Micali and V.V. Vazirani, An O(√|V||E|) algorithm for finding maximum matching in general graphs, Proc. 21th IEEE Symp. on Foundations of Computer Science, 1980, pp. 17-27.
29. 5-free graphs, to appear in Discrete Appl. Math.
30. S. Tsukiyama, M. Ide, H. Ariyoshi and I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Comput. 6 (1977), 505-517.
31. W.T. Tutte, A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956), 99-116.
32. 1/2|E|) general graph matching algorithm, Combinatorica 14 (1994), 71-91.
33. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932), 150-168.