The k best spanning arborescences of a network

This publication has 10 references indexed in Scilit:

• A note on finding optimum branchings
  Networks, 1979
• Two Algorithms for Generating Weighted Spanning Trees in Order
  SIAM Journal on Computing, 1977
• Finding optimum branchings
  Networks, 1977
• Finding Minimum Spanning Trees
  SIAM Journal on Computing, 1976
• Efficiency of a Good But Not Linear Set Union Algorithm
  Journal of the ACM, 1975
• Set Merging Algorithms
  SIAM Journal on Computing, 1973
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
  Management Science, 1972
• Reducibility among Combinatorial Problems
  Published by Springer Nature ,1972
• A simple derivation of edmonds' algorithm for optimum branchings
  Networks, 1971
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
  Operations Research, 1968