An Efficient Algorithm for the Min-Sum Arborescence Problem on Complete Digraphs (Q4282274): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/ijoc.5.4.426 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067802172 / rank | |||
Normal rank | |||
Latest revision as of 23:32, 19 March 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
