×
Bloniarz, Peter A.

A shortest-path algorithm with expected time \(O(n^ 2\log n \log n)\). (English) Zbl 0521.68078

SIAM J. Comput. 12, 588-600 (1983).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0521.68078

Cited in 2 Reviews
Cited in 13 Documents

MSC:

68R10 Graph theory (including graph drawing) in computer science
68Q25 Analysis of algorithms and problem complexity
90C35 Programming involving graphs or networks
05C38 Paths and cycles
05C35 Extremal problems in graph theory

Keywords:

nonnegatively weighted directed graph; shortest path; expected time; average time

Citations:

Zbl 0108.331; Zbl 0243.05118; Zbl 0254.05118
Cite Review PDF
Full Text: DOI