Finding optimum branchings

This publication has 10 references indexed in Scilit:

• Finding Minimum Spanning Trees
  SIAM Journal on Computing, 1976
• An 0(|E|loglog|V|) algorithm for finding minimum spanning trees
  Information Processing Letters, 1975
• Efficiency of a Good But Not Linear Set Union Algorithm
  Journal of the ACM, 1975
• Set Merging Algorithms
  SIAM Journal on Computing, 1973
• A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time $O(n^2 \log ^2 n)$
  SIAM Journal on Computing, 1973
• Depth-First Search and Linear Graph Algorithms
  SIAM Journal on Computing, 1972
• A simple derivation of edmonds' algorithm for optimum branchings
  Networks, 1971
• Optimum branchings
  Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959
• Shortest Connection Networks And Some Generalizations
  Bell System Technical Journal, 1957