论文信息 - A linear time algorithm for the maximum capacity path problem - 字舞流文

A linear time algorithm for the maximum capacity path problem

Abraham P. Punnen

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Paolo M. Camerini. The Min-Max Spanning Tree Problem and Some Extensions , 1978, Inf. Process. Lett..

[3] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .

[4] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[6] Kurt Mehlhorn,et al. Faster algorithms for the shortest path problem , 1990, JACM.

[7] Oded Berman,et al. Optimal Minimax Path of a Single Service Unit on a Network to Nonservice Destinations , 1987, Transp. Sci..