Every chordal graph G can be represented as the intersection graph of a collection of subtrees of a host tree, the so-called tree model of G. The leafage l(G) of a connected chordal graph G is the minimum number of leaves of the host tree of a tree model of G. This concept was first defined by I.-J. Lin, T.A. McKee, and D.B. West in [9]. In this contribution, we present the first polynomial time algorithm for computing l(G) for a given chordal graph G. In fact, our algorithm runs in time O(n 3) and it also constructs a tree model of G whose host tree has l(G) leaves. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Habib, M., & Stacho, J. (2009). Polynomial-time algorithm for the leafage of chordal graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5757 LNCS, pp. 290–300). https://doi.org/10.1007/978-3-642-04128-0_27
Mendeley helps you to discover research relevant for your work.