Computing the treewidth and the minimum fill-in with the modular decomposition (Q1402225)
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: Computing the treewidth and the minimum fill-in with the modular decomposition |
scientific article; zbMATH DE number 1967774
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the treewidth and the minimum fill-in with the modular decomposition |
scientific article; zbMATH DE number 1967774 |
Statements
Computing the treewidth and the minimum fill-in with the modular decomposition (English)
0 references
19 August 2003
0 references
Treewidth
0 references
Minimum fill-in
0 references
Modular decomposition
0 references
Minimal separators
0 references
Polynomial algorithms
0 references
Graph algorithms
0 references
