Arborescence optimization problems solvable by Edmonds' algorithm (Q1399999)
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: Arborescence optimization problems solvable by Edmonds' algorithm |
scientific article; zbMATH DE number 1957354
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Arborescence optimization problems solvable by Edmonds' algorithm |
scientific article; zbMATH DE number 1957354 |
Statements
Arborescence optimization problems solvable by Edmonds' algorithm (English)
0 references
30 July 2003
0 references
minimum arborescence
0 references
minimum directed spanning tree
0 references
Bottleneck
0 references
arborescence
0 references
lexicographically optimal arborescence
0 references
widest-minimum spanning tree
0 references
0 references
