Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs (Q4232801)
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 1262810
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs |
scientific article; zbMATH DE number 1262810 |
Statements
18 May 2000
0 references
weak bipolarizable graphs
0 references
0.8788188099861145
0 references
0.8674007654190063
0 references
0.7773838043212891
0 references
0.771797239780426
0 references
0.7712136507034302
0 references
Minimum fill-in and treewidth for graphs modularly decomposable into chordal graphs (English)
0 references
