A new algorithm for finding all shortest paths in a graph of positive arcs in average time \(O(n^2\log^2 n)\). (English) Zbl 0243.05118
SIAM J. Comput. (to appear).
MSC:
05C35 | Extremal problems in graph theory |
05C20 | Directed graphs (digraphs), tournaments |
05-04 | Software, source code, etc. for problems pertaining to combinatorics |