Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics

Volumn 146, Issue 3, 2005, Pages 193-218

  Meister, Daniel ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

AT free claw free graphs; Bandwidth; Co comparability graphs; Interval graphs; Minimal triangulations; Partition refinement; Proper interval graphs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BANDWIDTH; COMPUTATIONAL METHODS; SET THEORY; TRIANGULATION;

AT-FREE CLAW-FREE GRAPHS; CO-COMPARIBILITY GRAPHS; INTERVAL GRAPHS; MINIMAL TRIANGULATIONS; PARTITION REFINEMENT; PROPER INTERVAL GRAPHS;

GRAPH THEORY;

EID: 12344338405     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.10.001     Document Type: Article

References (51)

1. A. Berry, A wide-range efficient algorithm for minimal triangulation, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99, 1999, pp. 860-861.
2. A. Berry, J.R.S. Blair, P. Heggernes, Maximum cardinality search for computing minimal triangulations, Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002, Lecture Notes in Computer Science, vol. 2573, 2002, pp. 1-12.
3. A. Berry, and J.-P. Bordat Separability generalizes Dirac's theorem Discrete Appl. Math. 84 1998 43 53
4. J.R.S. Blair, P. Heggernes, and J.A. Telle A practical algorithm for making filled graphs minimal Theoret. Comput. Sci. 250 2001 125 141
5. K.S. Booth, and G.S. Lueker Testing for the consecutive ones property, internal graphs, and graph planarity using PQ-tree algorithms J. Comput. System Sci. 13 1976 335 379
6. A. Brandstadt, V.B. Le, J.P. Spinrad, Graph classes: a survey, SIAM Monographs on Discrete Mathematics and Applications, 1999.
7. A. Bretscher, D.G. Corneil, M. Habib, Chr. Paul, A simple linear time LexBFS cograph recognition algorithm, Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2003, Lecture Notes in Computer Science, vol. 2880, 2003, pp. 119-130.
8. D.G. Corneil A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs Discrete Appl. Math. 138 2004 371 379
9. D.G. Corneil, H. Kim, S. Natarajan, St. Olariu, and A.P. Sprague Simple linear time recognition of unit interval graphs Inform. Process. Lett. 55 1995 99 104
10. D.G. Corneil, St. Olariu, and L. Stewart Asteroidal triple-free graphs SIAM J. Discrete Math. 10 3 1997 399 430
11. D.G. Corneil, St. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? (Extended abstract), Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98, 1998, pp. 175-180.
12. D.G. Corneil, St. Olariu, and L. Stewart Linear time algorithms for dominating pairs in asteroidal triple-free graphs SIAM J. Comput. 28 4 1999 1284 1297
13. E. Dahlhaus, Minimal elimination ordering inside a given chordal graph, Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97, Lecture Notes in Computer Science, vol. 1335, 1997, pp. 132-143.
14. E. Dahlhaus, Minimal elimination of planar graphs, Proceedings of SWAT 1998, Lecture Notes in Computer Science, vol. 1432, 1998, pp. 210-221.
15. E. Dahlhaus Minimal elimination ordering for graphs of bounded degree Discrete Appl. Math. 116 2002 127 143
16. X. Deng, P. Hell, and J. Huang Linear-time representation algorithm for proper circular-arc graphs and proper interval graphs SIAM J. Comput. 25 1996 390 403
17. G.A. Dirac, On rigid circuit graphs. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg, vol. 25, 1962, pp. 71-76.
18. F.V. Fomin, and P.A. Golovach Interval degree and bandwidth of a graph Discrete Appl. Math. 129 2-3 2003 345 359
19. D.R. Fulkerson, and O.A. Gross Incidence matrices and interval graphs Pacific J. Math. 15 1965 835 855
20. T. Gallai Transitiv orientierbare Graphen Acta Math. Acad. Sci. Hungaricae 18 1967 25 26
21. M.R. Garey, R.L. Graham, D.S. Johnson, and D.E. Knuth Complexity results for Bandwidth minimization SIAM J. Appl. Math. 34 3 1978 477 495
22. M.Ch. Golumbic Algorithmic Graph Theory and Perfect Graphs 1980 Academic Press New York
23. M.Ch. Golumbic, Cl. Monma, and W.T. Trotter Jr. Tolerance graphs Discrete Appl. Math. 9 1984 157 170
24. M. Habib, R. McConnell, Chr. Paul, and L. Viennot Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing Theoret. Comput. Sci. 234 2000 59 84
25. H. Hempel, and D. Kratsch On claw-free asteroidal triple-free graphs Discrete Appl. Math. 121 2002 155 180
26. C.M. Herrera de Figueiredo, J. Meidanis, and C. Picinin de Mello A linear-time algorithm for proper interval graph recognition Inform. Process. Lett. 56 1995 179 184
27. L. Ibarra, Fully dynamic algorithms for chordal graphs and split graphs, Technical Report, University of Victoria, 2000.
28. H. Kaplan, and R. Shamir Pathwide, bandwidth, and completion problems to proper interval graphs with small cliques SIAM J. Comput. 25 3 1996 540 561
29. T. Kloks, D. Kratsch, H. Müller, Approximating the bandwidth for asteroidal triple-free graphs, Proceedings of the Third Annual European Symposium on Algorithms, ESA'95, Lecture Notes in Computer Science, vol. 979, 1995, pp. 434-447.
30. T. Kloks, D. Kratsch, and H. Müller Approximating the bandwidth for AT-free graphs J. Algorithms 32 1999 41 57
31. N. Korte, and R.H. Möhring An incremental linear-time algorithm for recognizing interval graphs SIAM J. Comput. 18 1 1989 68 81
32. D. Kratsch, R.M. McConnell, K. Mehlhorn, J.P. Spinrad, Certifying algorithms for recognised interval graphs and permutation graphs, Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003, 2003, pp. 709-716.
33. D. Kratsch, and L. Stewart Domination on cocomparability graphs SIAM J. Discrete Math. 6 3 1993 400 417
34. C.G. Lekkerkerker, and J.Ch. Boland Representation of finite graphs by a set of intervals on the real line Fundam. Math. 51 1962 45 64
35. P.J. Looges, and St. Olariu Optimal greedy algorithms for indifference graphs Comput. Math. Appl. 25 1993 15 25
36. R.M. McConnell, and J.P. Spinrad Modular decomposition and transitive orientation Discrete Math. 201 1-3 1999 180 241
37. K. Mehlhorn, and St. Näher The LEDA Platform for Combinatorial and Geometric Computing 1999 Cambridge University Press Cambridge
38. D. Meister, Recognizing and computing minimal triangulations efficiently, Technical Report 302, Institut für Informatik, Bayerische Julius-Maximilians-Universität Würzburg, 2002.
39. R.H. Möhring Triangulating graphs without asteroidal triples Discrete Appl. Math. 64 1996 281 287
40. St. Olariu An optimal greedy heuristic to color interval graphs Inform. Process. Lett. 37 1991 21 25
41. R. Paige, and R.E. Tarjan Three partition refinement algorithms SIAM J. Comput. 16 6 1987 973 989
42. B.S. Panda, and S.K. Das A linear time recognition algorithm for proper interval graphs Inform. Process. Lett. 87 2003 153 161
43. Ch.H. Papadimitriou The NP-completeness of the bandwidth minimization problem Computing 16 1976 263 270
44. A. Parra, Structural and algorithmic aspects of chordal graph embeddings, Dissertation, 1996, Technische Universität Berlin.
45. A. Parra, and P. Scheffler Characterizations and algorithmic applications of chordal graph embeddings Discrete Appl. Math. 79 1997 171 188
46. F.S. Roberts Indifference graphs F. Harary Proof Techniques in Graph Theory 1969 Academic Press New York 139 146
47. D.J. Rose Triangulated graphs and the elimination process J. Math. Anal. Appl. 32 1970 597 609
48. D.J. Rose, R.E. Tarjan, and G.S. Lueker Algorithmic aspects of vertex elimination on graphs SIAM J. Comput. 5 1976 266 283
49. A.P. Sprague An script O sign(n log n) algorithm for bandwidth of interval graphs SIAM J. Discrete Math. 7 2 1994 213 220
50. H. Wasserman, and M. Blum Software reliability via run-time result-checking J. ACM 44 6 1997 826 849
51. M. Yannakakis Computing the minimum fill-in is NP-complete SIAM J. Algebraic Discrete Methods 2 1981 77 79