A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking

  • Hajo Broersma
  • Ton Kloks
  • Dieter Kratsch
  • Haiko Müller
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1517)


A subset A of the vertices of a graph G is an asteroidal set if for each vertex aA, the set A∖{a} is contained in one component of G-N[a]. An asteroidal set of cardinality three is called asteroidal triple and graphs without an asteroidal triple are called AT-free. The maximum cardinality of an asteroidal set of G, denoted by an(G), is said to be the asteroidal number of G. We present a scheme for designing algorithms for triangulation problems on graphs. As a consequence, we obtain algorithms to compute graph parameters such as treewidth, minimum fill-in and vertex ranking number. The running time of these algorithms is a polynomial (of degree asteroidal number plus a small constant) in the number of vertices and the number of minimal separators of the input graph.


SIAM Journal Input Graph Chordal Graph Linear Time Algorithm Minimal Separator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arnborg, S.: Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey. BIT 25, 2–23 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM J. Alg. Disc. Meth. 8, 277–284 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bodlaender, H.: Kayles on special classes of graphs - An application of Sprague-Grundy theory. In: Mayr, E.W. (ed.) WG 1992. LNCS, vol. 657, pp. 90–102. Springer, Heidelberg (1993)CrossRefGoogle Scholar
  4. 4.
    Bodlaender, H.: A tourist guide through treewidth. Acta Cybernetica 11, 1–23 (1993)MathSciNetzbMATHGoogle Scholar
  5. 5.
    Bodlaender, H.: A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25, 1305–1317 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bodlaender, H., Deogun, J.S., Jansen, K., Kloks, T., Kratsch, D., Müller, H., Tuza, Z.: Rankings of graphs. SIAM Journal on Discrete Mathematics 11, 168–181 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Bodlaender, H.L., Gilbert, J.R., Hafsteinsson, H., Kloks, T.: Approximating tree-width, pathwidth and minimum elimination tree height. Journal of Algorithms 18, 238–255 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Bodlaender, H., Kloks, T., Kratsch, D.: Treewidth and pathwidth of permutation graphs. SIAM Journal on Discrete Mathematics 8, 606–616 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms. MlT Press, Cambridge (1990)zbMATHGoogle Scholar
  10. 10.
    Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM Journal on Discrete Mathematics 10, 399–430 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Corneil, D.G., Olariu, S., Stewart, L.: A linear time algorithm to compute dominating pairs in asteroidal triple-free graphs. In: Fülöp, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol. 944, pp. 292–302. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  12. 12.
    Deogun, J.S., Kloks, T., Kratsch, D., Müller, H.: On vertex ranking for permutation and other graphs. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol. 775, pp. 747–758. Springer, Heidelberg (1994)Google Scholar
  13. 13.
    Dirac, G.A.: On rigid circuit graphs. Abh. Math. Sem. Univ. Hamburg 25, 71–76 (1961)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)zbMATHGoogle Scholar
  15. 15.
    Habib, M., Möhring, R.H.: Treewidth of cocomparability graphs and a new order-theoretic parameter. Order 11, 47–60 (1994)Google Scholar
  16. 16.
    Kloks, T.: Treewidth - Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)zbMATHGoogle Scholar
  17. 17.
    Kloks, T., Kratsch, D.: Finding all minimal separators of a graph. SIAM Journal on Computing 27, 605–613 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Kloks, T., Kratsch, D., Müller, H.: Asteroidal sets in graphs. In: Möhring, R.H. (ed.) WG 1997. LNCS, vol. 1335, pp. 229–241. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  19. 19.
    Kloks, T., Kratsch, D., Spinrad, J.: On treewidth and minimum fill-in of aster-oidal triple-free graphs. Theoretical Computer Science 175, 309–335 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Kloks, T., Müller, H., Wong, C.K.: Vertex ranking of asteroidal triple-free graphs. In: Nagamochi, H., Suri, S., Igarashi, Y., Miyano, S., Asano, T. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 174–182. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  21. 21.
    Leiserson, C.E.: Area efficient graph layouts for VLSI. In: Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 270–281 (1980)Google Scholar
  22. 22.
    Lekkerkerker, C.G., Boland, J.C.: Representation of a finite graph by a set of intervals on the real line. Fundamenta Mathematicae 51, 45–64 (1962)Google Scholar
  23. 23.
    Lin, I.J., McKee, T.A., West, D.B.: Leafage of chordal graphs, Manuscript (1994)Google Scholar
  24. 24.
    Liu, J.W.H.: The role of elimination trees in sparse factorization. SIAM Journal of Matrix Analysis and Applications 11, 134–172 (1990)Google Scholar
  25. 25.
    Möhring, R.H.: Triangulating graphs without asteroidal triples. Discrete Applied Mathematics 64, 281–287 (1996)Google Scholar
  26. 26.
    Parra, A.: Structural and algorithmic aspects of chordal graph embeddings, PhD. thesis, Technische Universität Berlin (1996)Google Scholar
  27. 27.
    Prisner, E.: Representing triangulated graphs in stars. Abh. Math. Sem. Univ. Hamburg 62, 29–41 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing 5, 266–283 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  29. 29.
    Walter, J.R.: Representations of chordal graphs as subtrees of a tree. Journal of Graph Theory 2, 265–267 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  30. 30.
    Yannakakis, M.: Computing the minimum fill-in is NP-complete. SIAM Journal on Algebraic and Discrete Methods 2, 77–79 (1981)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Hajo Broersma
    • 1
  • Ton Kloks
    • 1
  • Dieter Kratsch
    • 2
  • Haiko Müller
    • 2
  1. 1.Faculty of Applied MathematicsUniversity of TwenteEnschedeThe Netherlands
  2. 2.Fakultät für Mathematik und InformatikFriedrich-Schiller-UniversitätJenaGermany

Personalised recommendations