Old and new results on packing arborescences in directed hypergraphs (Q1744239)
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: Old and new results on packing arborescences in directed hypergraphs |
scientific article; zbMATH DE number 6862768
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Old and new results on packing arborescences in directed hypergraphs |
scientific article; zbMATH DE number 6862768 |
Statements
Old and new results on packing arborescences in directed hypergraphs (English)
0 references
20 April 2018
0 references
arborescence
0 references
packing
0 references
directed hypergraph
0 references
matroid
0 references
0 references
0.8916761875152588
0 references
0.8780394792556763
0 references
0.870763897895813
0 references
0.8538157343864441
0 references
0.8454887866973877
0 references
