A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783)
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: A revisit of the scheme for computing treewidth and minimum fill-in |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A revisit of the scheme for computing treewidth and minimum fill-in |
scientific article |
Statements
A revisit of the scheme for computing treewidth and minimum fill-in (English)
0 references
28 March 2014
0 references
minimal separator
0 references
potential maximal clique
0 references
treewidth
0 references
minimum fill-in
0 references
