论文信息 - The Min-Max Spanning Tree Problem and Some Extensions - 字舞流文

The Min-Max Spanning Tree Problem and Some Extensions

Paolo M. Camerini

[1] Robert E. Tarjan,et al. Finding optimum branchings , 1977, Networks.

[2] Arnold Schönhage,et al. Finding the Median , 1976, J. Comput. Syst. Sci..

[3] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[4] Andrew Chi-Chih Yao,et al. An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees , 1975, Inf. Process. Lett..

[5] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[6] R. Prim. Shortest connection networks and some generalizations , 1957 .

[7] R. V. Slyke,et al. Computing minimum spanning trees efficiently , 1972, ACM Annual Conference.

[8] Harold N. Gabow,et al. Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..