Combining polynomial running time and fast convergence for the disk-covering method. (Q1872716)
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: Combining polynomial running time and fast convergence for the disk-covering method. |
scientific article; zbMATH DE number 1910845
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Combining polynomial running time and fast convergence for the disk-covering method. |
scientific article; zbMATH DE number 1910845 |
Statements
Combining polynomial running time and fast convergence for the disk-covering method. (English)
0 references
14 May 2003
0 references
chordal graph theorem
0 references
0 references
