An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (Q4282274): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:20, 6 February 2024
scientific article; zbMATH DE number 516687
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs |
scientific article; zbMATH DE number 516687 |
Statements
An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (English)
0 references
24 March 1994
0 references
min-sum arborescence problem
0 references
fixed root-vertex
0 references
complete digraphs
0 references
Edmonds method
0 references
