Treewidth and minimum fill-in on permutation graphs in linear time (Q708222)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Treewidth and minimum fill-in on permutation graphs in linear time |
scientific article; zbMATH DE number 5798140
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Treewidth and minimum fill-in on permutation graphs in linear time |
scientific article; zbMATH DE number 5798140 |
Statements
Treewidth and minimum fill-in on permutation graphs in linear time (English)
0 references
11 October 2010
0 references
graph algorithms
0 references
treewidth
0 references
minimal triangulation
0 references
linear time
0 references
permutation graphs
0 references
interval graphs
0 references
0 references
