A faster algorithm for finding edge-disjoint branchings (Q1838313): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A good algorithm for edge-disjoint branching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On two minimax theorems in graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Edge-disjoint branching in directed multigraphs / rank | |||
Normal rank | |||
Latest revision as of 18:37, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for finding edge-disjoint branchings |
scientific article |
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
