A matroid approach to finding edge connectivity and packing arborescences (Q1892220)
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: A matroid approach to finding edge connectivity and packing arborescences |
scientific article; zbMATH DE number 762171
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A matroid approach to finding edge connectivity and packing arborescences |
scientific article; zbMATH DE number 762171 |
Statements
A matroid approach to finding edge connectivity and packing arborescences (English)
0 references
8 June 1995
0 references
arborescence
0 references
directed graph
0 references
0.92425406
0 references
0.91361356
0 references
0.91033596
0 references
0.91033596
0 references
0.9097084
0 references
0.89090735
0 references
0.8880625
0 references
0.88752174
0 references
0.8854908
0 references
