Title of article
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs Original Research Article
Author/Authors
H.J. Broersma، نويسنده , , E. Dahlhaus، نويسنده , , T. Kloks، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2000
Pages
34
From page
367
To page
400
Abstract
A graph is distance hereditary if it preserves distances in all its connected induced subgraphs. The MINIMUM FILL-IN problem is the problem of finding a chordal supergraph with the smallest possible number of edges. The TREEWIDTH problem is the problem of finding a chordal embedding of the graph with the smallest possible clique number. In this paper we show that both problems are solvable in linear time for distance hereditary graphs.
Keywords
Chordal graphs , Linear time algorithm , Tree representation , Minimum fill-in , Treewidth , Fragment tree , Distance hereditary graphs
Journal title
Discrete Applied Mathematics
Serial Year
2000
Journal title
Discrete Applied Mathematics
Record number
885035
Link To Document