Treewidth and minimum fill-in on permutation graphs in linear time
Permutation graphs form a well-studied subclass of cocomparability graphs. Permutation graphs are the cocomparability graphs whose complements are also cocomparability graphs. A triangulation of a graph G is a graph H that is obtained by adding edges to G to make it chordal. If no triangulation of...
Saved in:
Published in | Theoretical computer science Vol. 411; no. 40; pp. 3685 - 3700 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
Oxford
Elsevier B.V
06.09.2010
Elsevier |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!