Treewidth and minimum fill-in on permutation graphs in linear time (Q708222): Difference between revisions
From MaRDI portal
Latest revision as of 01:24, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Treewidth and minimum fill-in on permutation graphs in linear time |
scientific article |
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