A faster algorithm for finding edge-disjoint branchings (Q1838313)
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 faster algorithm for finding edge-disjoint branchings |
scientific article; zbMATH DE number 3804866
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for finding edge-disjoint branchings |
scientific article; zbMATH DE number 3804866 |
Statements
A faster algorithm for finding edge-disjoint branchings (English)
0 references
1983
0 references
directed multigraph
0 references
constructive proof of Edmonds' branchings theorem
0 references
edge-connectivity
0 references
