M. Thorup. Floats, integers, and single source shortest paths. Journal of Algorithms, 35:189-201, 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
All Pairs Shortest Paths using Bridging Sets and Rectangular.. - Zwick (2000) (5 citations) (Correct)
....SCIENCE FOUNDATION founded by The Israel Academy of Sciences and Humanities. 1 Phillips [KKP93] and McGeoch [McG95] For undirected graphs with nonnegative integer edge weights, a running time of O(mn) can be obtained by running a recent single source shortest paths algorithm of Thorup [Tho99] [Tho00] from each vertex of the graph. The running time of all the above mentioned algorithms may be as high as n 3 ) Can the APSP problem be solved in sub cubic time Fredman [Fre76] showed that the APSP problem for weighted directed graphs can be solved non uniformly in O(n 2:5 ) time. More ....
M. Thorup. Floats, integers, and single source shortest paths. Journal of Algorithms, 35:189-201, 2000.
All Pairs Shortest Paths in Undirected Graphs with Integer.. - Shoshan, Zwick (1999) (8 citations) (Correct)
....graph problems. The APSP problem for directed or undirected graphs with real weights can be solved using classical methods, in O(mn n 2 log n) time (Dijkstra [4] Johnson [10] Fredman and Tarjan [7] or in O(n 3 ( log log n) log n) 1=2 ) time (Fredman [6] Takaoka [12] Thorup [14] [15] recently showed that for undirected graphs with integer weights, the problem can actually be solved in O(mn) time. In the last decade, it was shown that fast algorithms for algebraic matrix multiplication can be used to obtain faster algorithms for solving the APSP problem in dense graphs with ....
M. Thorup. Floats, integers, and single source shortest paths. In Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, pages 14-- 24, 1998.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) Self-citation (Thorup) (Correct)
No context found.
M. Thorup. Floats, integers, and single source shortest paths. Journal of Algorithms, 35:189-- 201, 2000.
Approximate Distance Oracles - Thorup, Zwick (2001) (33 citations) Self-citation (Thorup) (Correct)
No context found.
M. Thorup. Floats, integers, and single source shortest paths. J. Algorithms, 35:189--201, 2000.
Approximate Distance Oracles - Mikkel Thorup Uri (2001) (33 citations) Self-citation (Thorup) (Correct)
No context found.
M. Thorup. Floats, integers, and single source shortest paths. Journal of Algorithms, 35:189-- 201, 2000.
A faster algorithm for Minimum Cycle Basis of graphs - Kavitha, Mehlhorn, Michail, .. (2004) (Correct)
No context found.
M. Thorup. Floats, integers, and single source shortest paths. Journal of Algorithms, 35:189-201, 2000.
Exact and Approximate Distances in Graphs - a survey - Zwick (2001) (8 citations) (Correct)
No context found.
M. Thorup. Floats, integers, and single source shortest paths. Journal of Algorithms, 35:189-201, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC