Ranking arborescences in O(Km log n) time
- 30 April 1980
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 4 (4) , 235-242
- https://doi.org/10.1016/0377-2217(80)90107-1
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- Finding optimum branchingsNetworks, 1977
- Finding Minimum Spanning TreesSIAM Journal on Computing, 1976
- On Finding Lowest Common Ancestors in TreesSIAM Journal on Computing, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Set Merging AlgorithmsSIAM Journal on Computing, 1973
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path ProblemManagement Science, 1972
- A simple derivation of edmonds' algorithm for optimum branchingsNetworks, 1971
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing CostOperations Research, 1968