On packing spanning arborescences with matroid constraint (Q1689956)
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 6827210
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On packing spanning arborescences with matroid constraint |
scientific article; zbMATH DE number 6827210 |
Statements
On packing spanning arborescences with matroid constraint (English)
0 references
18 January 2018
0 references
connectivity
0 references
packing arborescences
0 references
Edmonds' branching theorem
0 references
matroid
0 references
0.99999976
0 references
0.96724176
0 references
0.95820785
0 references
0.92865413
0 references
0.9199051
0 references
0.9199051
0 references
0 references
0.91033596
0 references
0.91006553
0 references
