Finding augmenting chains in extensions of claw-free graphs

Information Processing Letters

Volumn 86, Issue 6, 2003, Pages 311-316

  Hertz, A ^a   Lozin, V ^b   Schindl, D ^c  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b RUTGERS UNIVERSITY   (United States)

^c EPFL   (Switzerland)

Author keywords

Augmenting chains; Combinatorial problems; Graph algorithms; Polynomial algorithms; Stable sets

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

AUGMENTING CHAINS;

COMPUTER SCIENCE;

EID: 0038286386     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00223-0     Document Type: Article

References (16)

1. Alekseev V.E. Polynomial algorithm for finding the largest independent sets in graphs without forks. Discrete Anal. Oper. Res. 6:(4):1999;3-19. (in Russian); transl. to appear in Discrete Appl. Math., doi: 10.1016/S0166-218X(02)00290-1.
2. Alekseev V., Lozin V. Augmenting graphs for independent sets, Discrete Appl. Math., to appear; available on-line at http://rutcor.rutgers.edu/pub/rrr/reports2000/59.ps.
3. Berge C. Two theorems in graph theory. Proc. Nat. Acad. Sci. USA. 43:1957;842-844.
4. 5 -free graphs, Discrete Appl. Math., to appear, doi: 10.1016/S0166-218X(03)00221-X; available on-line at http://rutcor.rutgers.edu/pub/rrr/reports2001/55.ps.
5. Edmonds J. Paths, trees, and flowers. Canad. J. Math. 17:1965;449-467.
6. Gerber M., Hertz A., Lozin V. Stable sets in two subclasses of banner-free graphs, Discrete Appl. Math., to appear; available on-line at http://rutcor.rutgers.edu/pub/rrr/reports2001/46.ps.
7. 5 -free graphs. Discrete Appl. Math. 125:2003;215-224.
8. 5 -free augmenting graphs and the maximum stable set problem, Discrete Appl. Math., to appear.
9. 5 - and Banner-free graphs. European J. Oper. Research. 125:(2):2000;292-297.
10. Minty G.J. On maximal independent sets of vertices in claw-free graphs. J. Combin. Theory Ser. B. 28:1980;284-304.
11. 5 -free graphs. Inform. Process. Lett. 61:1997;137-144.
12. 6 -free graphs. Discrete Appl. Math. 92:1999;177-191.
13. 5-free graphs, Discrete Appl. Math., to appear.
14. Murphy O.J. Computing independent sets in graphs with large girth. Discrete Appl. Math. 35:1992;167-170.
15. Nakamura D., Tamura A. A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph. J. Oper. Res. Soc. Japan. 44:(2):2001;194-204.
16. Sbihi N. Algorithme de recherche d'un independent de cardinalité maximum dans un graphe sans étoile. Discrete Math. 29:1980;53-76.