Powers of asteroidal triple-free graphs with applications

Ars Combinatoria

Volumn 67, Issue , 2003, Pages 161-173

  Chang, Jou Ming ^a,b   Ho, Chin Wen ^a   Ko, Ming Tat ^c  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b NATIONAL TAIPEI UNIVERSITY OF BUSINESS   (Taiwan)

^c INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

Asteroidal triple; At free graphs; Cocomparability graphs; Powers of graphs

Indexed keywords

EID: 14944361049     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (30)

1. N. Abbas and L. Stewart, Clustering bipartite and chordal graphs: complexity, sequential and parallel algorithms, Discrete Appl. Math. 91 (1999) 1-23.
2. K. Arvind, H. Breu, M. S. Chang, D. G. Kirkpatrick, F. Y. Lee, Y. D. Liang, K. Madhukar, C. P. Rangan and A. Srinivasan, Efficient algorithms in cocomparability and trapezoid graphs, manuscript (1996).
3. H. Balakrishnan, A. Rajaraman and C. P. Rangan, Connected domination and steiner set on Asteroidal triple-free graphs, in: Proc. WADS'93, Lecture Notes in Computer Science 709, Springer-Verlag, (1993) pp. 131-141.
4. C. Berge, Les problèmes de coloration en theéorie des graphes, Publ. Inst. Statnt. Univ. Paris 9 (1960) 123-160.
5. A. Brandstädt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, (series SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, PA, 1999).
6. H. Broersma, T. Kloks, D. Kratsch and H. Müller, Independent sets in asteroidal triple-free graphs, SIAM J. Discrete Math. 12 (1999) 276-287.
7. G. J. Chang and G. L. Nemhauser, The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Alg. Disc. Meth. 5 (1984) 332-345.
8. F. Cheah, A recognition algorithm for II-graphs, Doctoral thesis, Department of Computer Science, University of Toronto (1990).
9. D. G. Corneil, S. Olariu and L. Stewart, A linear time algorithm to compute a dominating path in an AT-free graph, Inform. Process. Lett. 54 (1995) 253-257.
10. D. G. Corneil, S. Olariu and L. Stewart, Asteroidal triple-free graphs, SIAM J. Discrete Math. 10 (1997) 399-430.
11. D. G. Corneil, S. Olariu and L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, SIAM J. Comput. 28 (1999) 1284-1297.
12. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Comput. 9 (1990) 251-280.
13. P. Damaschke, Distances in cocomparability graphs and their powers, Discrete Appl. Math. 35 (1992) 67-72.
14. J. S. Deogun, D. Kratsch and G. Steiner, An approximation algorithm for clustering graphs with dominating diametral path, Inform. Process. Lett. 61 (1997) 121-127.
15. C. Flotow, On powers of m-trapezoid graphs, Discrete Appl. Math. 63 (1995) 187-192.
16. M. R. Garey and D. S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness, (Freeman, San Francisco, CA, 1979).
17. M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, (Academic Press, New York, 1980).
18. T. Y. Ho, J. M. Chang and Y. L. Wang, On the powers of graphs with bounded asteroidal number, Discrete Math. 223 (2000) 125-133.
19. T. Kloks, D. Kratsch and J. Spinrad, On treewidth and minimum fill-in of asteroidal triple-free graphs, Theor. Comput. Sci. 175 (1997) 309-335.
20. T. Kloks. H. Müller and C. K. Wong, Vertex ranking of asteroidal triple-free graphs, Inform. Process. Lett. 68 (1998) 201-206.
21. E. Köhler, Recognizing graphs without asteroidal triples, in: Proc. WG2000, Lecture Notes in Computer Science 1928, Springer-Verlag, (2000) pp. 2551-266.
22. D. Kratsch, Domination and total domination on asteroidal triple-free graphs, Discrete Appl. Math. 99 (2000) 111-123.
23. D. Kratsch and L. Stewart, Domination on cocomparability graphs, SIAM J. Discrete Math. 6 (1993) 400-417.
24. C. G. Lekkerkerker and J. C. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math. 51 (1962) 45-64.
25. R. M. McConnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Math. 201 (1999) 189-241.
26. R. H. Möhring, Triangulating graphs without asteroidal triples, Discrete Appl. Math. 64 (1996) 281-287.
27. A. Parra and P. Scheffier, Characterizations and algorithmic applications of chordal graph embeddings, Discrete Appl. Math. 79 (1997) 171-188.
28. A. Raychaudhuri, On powers of interval and unit interval graphs, Cong. Num. 59 (1987) 235-242.
29. R. Seidel, On the all-pairs-shortest-path problem in unweighted undirected graphs, J. Comput. System Sci. 51 (1995) 400-403.
30. J. Spinrad, On comparability and permutation graphs, SIAM J. Comput. 14 (1985) 658-670.