Lexbfs-ordering in asteroidal triple-free graphs

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

Volumn 1741, Issue , 1999, Pages 163-172

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

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

^c NATIONAL TAIPEI UNIVERSITY OF BUSINESS   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

ASTEROIDAL TRIPLE-FREE; AT-FREE; BIPARTITE PERMUTATION GRAPHS; LINEAR TIME; METRIC PROPERTIES; RECOGNITION ALGORITHM; VERTEX ORDERING;

GRAPHIC METHODS;

EID: 84958039986     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_17     Document Type: Conference Paper

References (23)

1. A. Brandstädt, V. B. Le and J. P. Spinrad, Graph Classes: A Survey, (series SIAM Monographs on Discrete Mathematics and Applications, 1999).
2. K. S. Booth and G. S. Lueker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J. Comput. System Sci., 13 (1976) 335-379.
3. H. Broersma, T. Kloks, D. Kratsch and H. Muller, Independent sets in asteroidal triple-free graphs, SIAM J. Discrete Math., 12 (1999) 276-287.
4. J. M. Chang, C. W. Ho and M. T. Ko, Distances in asteroidal triple-free graphs and their powers, in: Proceedings of CTS Workshop on Combinatorics and Algorithms, Taipei, Taiwan, (1998) 1-14.
5. D. G. Corneil, F. F. Dragan, M. Habib and C. Paul, Diameter determination on restricted graph families, in: Proceedings of WG’98, LNCS Vol. 1517, Springer- Verlag, (1998) 192-202.
6. 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.
7. D. G. Corneil, S. Olariu and L. Stewart, Asteroidal triple-free graphs, SIAM J. Discrete Math., 10 (1997), 399-430.
8. D. G. Corneil, S. Olariu and L. Stewart, Linear time algorithms for dominating pairs in asteroidal triple-free graphs, in: Proceedings of ICALP’95, LNCS Vol. 944, Springer-Verlag, (1995) 292-302.
9. T. Gallai, Transitiv orientierbare Graphen, Acta Math. Acad. Sci. Hung., 18 (1967) 25-66
10. M. C. Golumbic, C. L. Monma and W. T. Trotter Jr. Tolerance graphs, Discrete Appl. Math., 9 (1984), 157-170.
11. 4-comparability graphs, Discrete Math., 74 (1989) 173-200.
12. B. Jamison and S. Olariu, On the semi-perfect elimination, Adv. Appl. Math., 9 (1988) 364-376.
13. 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.
14. T. Kloks, H. Müller and C. K. Wong, Vertex ranking of asteroidal triple-free graphs, Inform. Process. Lett., 68 (1998) 201-206.
15. D. Kratsch, Domination and total domination on asteroidal triple-free graphs, Forschungsergebnisse Math/Inf/96/25, FSU Jena, Germany, 1996.
16. D. Kratsch, H. O. Le, H. Muller and E. Prisner, Additive tree spanners, manuscript, 1998.
17. 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.
18. A. Pnueli, A. Lempel and S. Even, Transitive orientation of graphs and identification of permutation graphs, Canad. J. Math., 23 (1971) 160-175.
19. D. J. Rose, Triangulated graphs and the elimination process, J. Math. Anal. Appl., 32 (1970) 597-609.
20. D. J. Rose, R. E. Tarjan and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976) 266-283.
21. 2) time, in: Proceedings of 15th Ann. ACM Symp. on Theory of Computing, (1983) 457-466.
22. J. Spinrad, A. Brandstüadt and L. Stewart, Bipartite permutation graphs, Discrete Appl. Math., 18 (1987) 279-292.
23. R. E. Tarjan and M. Yanakakis, Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs, SIAM J. Comput., 13 (1984) 566-579.