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 the normal view instead:
scientific article; zbMATH DE number 6275297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A revisit of the scheme for computing treewidth and minimum fill-in |
scientific article; zbMATH DE number 6275297 |
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
0.7625236511230469
0 references
0.7518119812011719
0 references
0.7512895464897156
0 references
0.7473938465118408
0 references
