On robust algorithms for the maximum weight stable set problem

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

Volumn 2138, Issue , 2001, Pages 445-458

  Brandstädt, Andreas ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Clique width; Graph structure; Maximum weight stable set problem on graphs; Modules and homogeneous sets in graphs; Prime graphs; Robust algorithms

Indexed keywords

GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

CLIQUE-WIDTH; GRAPH STRUCTURES; MAXIMUM WEIGHT STABLE SET PROBLEMS; MODULES AND HOMOGENEOUS SETS IN GRAPHS; PRIME GRAPH; ROBUST ALGORITHM;

GRAPH THEORY;

EID: 29344435871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44669-9_51     Document Type: Conference Paper

References (52)

1. V.E. Alekseev, A polynomial algorithm for finding maximum independent sets in fork-free graphs, Discr. Analysis and Oper. Research Vol. 6 No. 4 (1999) 3-19
2. 5, diamond)-free graphs, Manuscript 1995
3. L. Babel, S. Olariu, On the p-connectedness of graphs: A survey, Discrete Applied Math. 95 (1999) 11-33
4. 5,diamond)-Free Graphs Revisited: Structure and Linear Time Optimization, Manuscript 2000
5. 4 extensions, Manuscript 2001
6. 5, Bull)-Free, and (Bull,Claw)-Free Graphs and the Maximum Stable Set Problem, Manuscript 2001
7. 5-free and more general graphs, Discrete Applied Math. 95 (1999) 163-167
8. A. Brandstädt, C.T. Hoàng, V.B. Le, Stability number of bull- and chair-free graphs revisited, Manuscript 2001
9. 4)-free graphs with substitutions, RUTCOR Research Report, Rutgers University, New Brunswick NJ, 28-2001 (2001)
10. A. Brandstädt, C.T. Hoàng, I. Zverovich, All extensions of a four-vertex graph in a prime graph, Manuscript in preparation, 2001
11. 5,Gem)-Free Graphs and Related Graph Classes: Structure and Algorithmic Applications, Manuscript 2001
12. A. Brandstädt, H.-O. Le, J.-M. Vanherpe, Structure and Stability Number of (Chair,Co-P,Gem)-Free Graphs Revisited, Manuscript 2001
13. A. Brandstädt, V.B. Le, J. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. Appl., Vol. 3, SIAM, Philadelphia (1999)
14. A. Brandstädt, V.V. Lozin, A note on α-redundant vertices in graphs, Discrete Applied Math. 108 (2001) 301-308
15. 5- and Co-Chair-Free Graphs, Manuscript 2001
16. D.G. Corneil The complexity of generalized clique packing, Discrete Applied Math. 12 (1985) 233-239
17. D.G. Corneil, H. Lerchs, L. Stewart-Burlingham, Complement reducible graphs, Discrete Applied Math. 3 (1981) 163-174
18. D.G. Corneil, Y. Perl, L.K. Stewart, Cographs: recognition, applications, and algorithms, Congressus Numer. 43 (1984) 249-258
19. D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926-934
20. B. Courcelle, J. Engelfriet, G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. Syst. Sciences, 46 (1993) 218-270
21. B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique width, extended abstract in: Conf. Proc. WG’98, LNCS 1517 (1998) 1-16
22. B. Courcelle, S. Olariu, Upper bounds to the clique width of graphs, Discrete Appl. Math. 101 (2000) 77-114
23. A. Cournier, M. Habib, A new linear algorithm for modular decomposition, LIRMM, University Montpellier (1995), Preliminary version in: Trees in Algebra and Programming – CAAP ’94, LNCS 787 (1994) 68-84
24. E. Dahlhaus, J. Gustedt, R.M. McConnell, Efficient and practical modular decomposition, Tech. Report TU Berlin FB Mathematik, 524/1996 (1996), in: Conference Proceedings 8th SODA (1997), 26-35
25. C. De Simone, On the vertex packing problem, Graphs and Combinatorics 9 (1993) 19-30
26. C. De Simone, A. Sassano, Stability number of bull- and chair-free graphs, Discrete Applied Math. 41 (1993) 121-129
27. M. Farber, On diameters and radii of bridged graphs, Discrete Math. 73 (1989) 249-260
28. 5)-free graphs, Discrete Math. 121 (1993) 75-83
29. 4-sparse graphs, Discrete Math. 165-166 (1997) 267-290
30. 5, Discrete Math. 146 (1995) 33-44
31. 5)-free graphs, Discrete Appl. Math. 80 (1997) 255-261
32. 4-Sparse Graphs, Theoretical Computer Science 180 (1997) 269-286
33. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York 1980
34. M.C. Golumbic, U. Rotics, On the Clique-Width of Perfect Graph Classes, Intern. Workshop on Graph–Theoretic Concepts in Comp. Sci. WG’98, Lecture Notes in Comp. Sci. 1665 (1999) 135-147
35. C.T. Hoàng, A Class of Perfect Graphs, Ms. Sc. Thesis, School of Computer Science, McGill University, Montreal (1983)
36. C.T. Hoàng, Perfect Graphs, Ph. D. Thesis, School of Computer Science, McGill University Montreal (1985)
37. C.T. Hoàng, B. Reed, Some classes of perfectly orderable graphs, J. Graph Theory 13 (1989) 445-463
38. 4-sparse graphs, Discrete Appl. Math. 35 (1992), 115-129
39. V.V. Lozin, Conic reduction of graphs for the stable set problem, Discrete Math. 222 (2000) 199-211
40. N.V.R. Mahadev, U.N. Peled, Threshold Graphs and Related Topics, Annals of Discrete Mathematics 56 (1995)
41. R.M. McConnell, J. Spinrad, Linear-time modular decomposition and efficient transitive orientation of comparability graphs, 5th. Ann. ACM–SIAM Symp. on Discrete Algorithms, Arlington, Virginia, 1994, 536-543
42. R.M. McConnell, J. Spinrad, Modular decomposition and transitive orientation, Discrete Math. 201 (1999) 189-241
43. G.J. Minty, On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory (B) 28 (1980) 284-304
44. R.H. Möhring, F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Annals of Discrete Math. 19 (1984) 257-356
45. S. Olariu, On the closure of triangle-free graphs under substitution, Information Processing Letters 34 (1990) 97-101
46. S. Poljak, A note on stable sets and colorings of graphs, Commun. Math. Univ. Carolinae 15 (1974) 307-309
47. N. Sbihi, Algorithme de recherche d’un stable de cardinalité maximum dans un graphe sans étoile, Discrete Math. 29 (1980) 53-76
48. J.P. Spinrad, Representations of graphs, Book Manuscript, Vanderbilt University, Nashville (TN) 1998
49. S. Tsukiyama, M. Ide, H. Ariyoshi, I. Shirakawa, A new algorithm for generating all the maximal independent sets, SIAM J. Computing 6 (1977) 505-517
50. M. Yannakakis, The complexity of the partial order dimension problem, SIAM J. Algebraic and Discrete Methods 3 (1982) 351-358;
51. I. Zverovich, Extension of hereditary classes with substitutions, Rutcor Research Report RRR 14-2001 (2001) http://rutcor.rutgers.edu/∼rrr
52. 5)-free graphs, Rutcor Research Report RRR 22-2001 (2001) http://rutcor.rutgers.edu/∼rrr