On finding spanning trees with few leaves (Q2380066)
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 5686493
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding spanning trees with few leaves |
scientific article; zbMATH DE number 5686493 |
Statements
On finding spanning trees with few leaves (English)
0 references
24 March 2010
0 references
approximation algorithms
0 references
graph algorithms
0 references
spanning trees
0 references
0.8702554702758789
0 references
0.8670324683189392
0 references
0.8666607141494751
0 references
0.8544655442237854
0 references
