Augmenting graphs for independent sets

Discrete Applied Mathematics

Volumn 145, Issue 1 SPEC. ISS., 2004, Pages 3-10

  Alekseev, Vladimir E ^a   Lozin, Vadim V ^b  

^a LOBACHEVSKY STATE UNIVERSITY OF NIZHNY NOVGOROD   (Russian Federation)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Augmenting graph; Independent set; Polynomial algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

AUGMENTING GRAPHS; INDEPENDENT SETS; POLYNOMIAL ALGORITHMS;

GRAPH THEORY;

EID: 4944262522     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.09.003     Document Type: Conference Paper

References (16)

1. V.E. Alekseev, The effect of local constraints on the complexity of determination of the graph independence number, Combinatorial-algebraic methods in applied mathematics, Gorkiy University Press, Gorky, 1982, pp. 3-13 (in Russian).
2. Alekseev V.E. A polynomial algorithm for the independent set problem in fork-free graphs. Discrete Anal. Oper. Res. 6(4):1999;3-21. (in Russian).
3. Berge C. Two theorems in graph theory. Proc. Nat. Acad. Sci. USA. 43:1957;842-844.
4. Corneil D.G., Perl Y., Stewart L.K. A linear recognition algorithm for cographs. SIAM J. Comput. 14:1985;926-934.
5. Simone C.De, Sassano A. Stability number of bull- and chair-free graphs. Discrete Appl. Math. 41:1993;121-129.
6. Edmonds J. Path, trees, and flowers. Canad. J. Math. 17:1965;449-467.
7. 4 sparse graphs Discrete Math. 165-166:1997;277-300.
8. Golumbic M.C. Trivially perfect graphs. Discrete Math. 24:1978;105-107.
9. Hertz A. Polynomially solvable cases for the maximum independent set problem. Discrete Appl. Math. 60:1995;195-210.
10. 5 - And Banner-free graphs European J. Oper. Res. 125(2):2000;292-297.
11. Lozin V.V. E-free bipartite graphs Discrete Analysis and Oper. Res. Ser. 1. 7(1):2000;49-66. (in Russian).
12. Minty G.J. On maximal independent sets of vertices in claw-free graphs. J. Comb. Theory Ser. B. 28:1980;284-304.
13. 5 -free graphs Inform. Process. Lett. 61:1997;137-144.
14. 6 -free graphs Discrete Appl. Math. 92:1999;177-191.
15. Sbihi N. Algorithme de recherche d'un independent de cardinalité maximum dans un graphe sans étoile. Discrete Math. 29:1980;53-76.
16. Yan J.-H., Chen J.-J., Chang G.J. Quasi-threshold graphs. Discrete Appl. Math. 69:1996;247-255.