Minimum fill-in of sparse graphs: kernelization and approximation (Q2911621)
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: Minimum fill-in of sparse graphs: kernelization and approximation |
scientific article; zbMATH DE number 6075069
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum fill-in of sparse graphs: kernelization and approximation |
scientific article; zbMATH DE number 6075069 |
Statements
31 August 2012
0 references
minimum fill-in
0 references
approximation
0 references
kernelization
0 references
sparse graphs
0 references
0.99999976
0 references
0.90150964
0 references
0.87704307
0 references
0.87704307
0 references
0.8759407
0 references
0.87471324
0 references
0.8700642
0 references
0 references
Minimum fill-in of sparse graphs: kernelization and approximation (English)
0 references
