Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q1290635)
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: Packing algorithms for arborescences (and spanning trees) in capacitated graphs |
scientific article; zbMATH DE number 1294685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packing algorithms for arborescences (and spanning trees) in capacitated graphs |
scientific article; zbMATH DE number 1294685 |
Statements
Packing algorithms for arborescences (and spanning trees) in capacitated graphs (English)
0 references
15 September 1999
0 references
covering
0 references
Newton's method
0 references
capacitated digraphs
0 references
packing spanning trees
0 references
arborescence packing
0 references
laminar family of sets
0 references
0.9954750537872314
0 references
0.865861177444458
0 references
0.8597029447555542
0 references
