Independent sets in asteroidal triple-free graphs

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 2, 1999, Pages 276-287

  Broersma, Hajo ^a   Kloks, Ton ^b   Kratsch, Dieter ^c   Müller, Haiko ^c  

^a UNIVERSITY OF TWENTE   (Netherlands)

^b CHARLES UNIVERSITY   (Czech Republic)

^c FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY;

ASTEROIDAL TRIPLE (AT) FREE GRAPHS; INDEPENDENT PERFECT DOMINATING SETS;

GRAPH THEORY;

EID: 0032623459     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480197326346     Document Type: Article

References (28)

1. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
2. H. BALAKRISHNAN, A. RAJARAMAN, AND C. PANDU RANGAN, Connected domination and Steiner set on asteroidal triple-free graphs, in Proceedings of WADS'93, Lecture Notes in Computer Science 709, Springer-Verlag, New York, 1993, pp. 131-141.
3. A. BRANDSTÄDT, Special graph classes - A survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universität Duisburg Gesamthochschule, Duisburg, Germany, 1991.
4. H. BREU AND D. G. KIRKPATRICK, Algorithms for Domination and Steiner Tree Problems in Cocomparability Graphs, University of British Columbia, Vancouver, manuscript 1993.
5. M. S. CHANG, Weighted domination on cocomparability graphs, in Proceedings of ISAAC'95, Lecture Notes in Computer Science 1004, Springer-Verlag, New York, 1996, pp. 122-131.
6. D. G. CORNEIL, S. OLARIU, AND L. STEWART, Asteroidal triple-free graphs, SIAM J. Discrete Math., 10 (1997), pp. 399-430.
7. D. G. CORNEIL, S. OLARIU, AND L. STEWART, A linear time algorithm to compute dominating pairs in asteroidal triple-free graphs, in Proceedings of ICALP'95, Lecture Notes in Computer Science 944, Springer-Verlag, New York, 1995, pp. 292-302.
8. J. S. DEOGUN AND G. STEINER, Polynomial algorithms for Hamiltonian cycle in cocomparability graphs, SIAM J. Comput., 23 (1994), pp. 520-552.
9. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
10. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
11. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Polynomial algorithms for perfect graphs, Ann. Disc. Math., 21 (1984), pp. 325-356.
12. 1-ε, in Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, Burlington, VT, 1996, pp. 627-636.
13. D. S. JOHNSON, The NP-completeness column: An ongoing guide, J. Algorithms, 6 (1985), pp. 434-451.
14. T. KLOKS, Treewidth - Computations and Approximations, Lecture Notes in Computer Science 842, Springer-Verlag, New York, 1994.
15. H. J. BROERSMA, T. KLOKS, D. KRATSCH, AND H. MU-̈LLER, A generalization of AT-free graphs and a generic algorithm for solving triangulation problems, in Proceedings of WG'98, Lecture Notes in Computer Science 1517, Springer-Verlag, New York, 1998, pp. 88-89.
16. T. KLOKS, D. KRATSCH, AND H. MÜLLER, Asteroidal sets in graphs, in Proceedings of WG'97, Lecture Notes in Computer Science 1335, Springer-Verlag, New York, 1997, pp. 229-241.
17. T. KLOKS, D. KRATSCH, AND J. SPINRAD, On treewidth and minimum fill-in of asteroidal triple-free graphs, Theoret. Comput. Sci., 175 (1997), pp. 309-335.
18. T. KLOKS, H. MÜLLER, AND C. K. WONG, Vertex ranking of asteroidal triple-free graphs, in Proceedings of ISAAC'96, Lecture Notes in Computer Science 1178, Springer-Verlag, New York, 1996, pp. 174-182.
19. D. KRATSCH, Domination and Total Domination on Asteroidal Triple-Free Graphs, Forschungsergebnisse Math/Inf/96/25, FSU Jena, Germany, 1996.
20. C. G. LEKKERKERKER AND J. CH. BOLAND, Representation of a finite graph by a set of intervals on the real line, Fund. Math., 51 (1962), pp. 45-64.
21. I. J. LIN, T. A. MCKEE, AND D. B. WEST, Leafage of chordal graphs, Discuss. Math. Graph Theory, 18 (1998), pp. 23-48.
22. F. MAFFRAY AND M. PREISSMAN, On the NP-completeness of the k-colorability problem for triangle-free graphs, Discrete Math., 162 (1996), pp. 313-317.
23. R. H. MÖHRING, Triangulating graphs without asteroidal triples, Discrete Appl. Math., 64 (1996), pp. 281-287.
24. R. M. MCCONNELL AND J. P. SPINRAD, Linear time transitive orientation, in Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, 1997, pp. 19-25.
25. E. PRISNER, Representing triangulated graphs in stars, Abh. Math. Sem. der Univ. Hamburg, 62 (1992), pp. 29-41.
26. R. UEHARA, NP-Complete Problems on a 3-Connected Cubic Planar Graph and Their Applications, Technical report TWCU-M-0004, Tokyo Woman's Christian University, 1996.
27. J. R. WALTER, Representations of chordal graphs as subtrees of a tree, J. Graph Theory, 2 (1978), pp. 265-267.
28. M. YANNAKAKIS, Computing the minimum fill-in is NP-complete, SIAM J. Algebraic Discrete Methods, 2 (1981), pp. 77-79.