A shortest-path algorithm with expected time \(O(n^ 2\log n \log n)\). (English) Zbl 0521.68078
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 |