Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition (Q3046514): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Hans L. Bodlaender / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Udi Rotics / rank | |||
Normal rank | |||
Revision as of 17:27, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition |
scientific article |
Statements
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition (English)
0 references
12 August 2004
0 references
Algorithms and data structures
0 references
graph algorithms
0 references
treewidth
0 references
minimum fill-in
0 references
modular decomposition
0 references
minimal separators
0 references
