Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and network algorithms
Data structures and network algorithms
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Efficient Algorithms for Shortest Paths in Sparse Networks
Journal of the ACM (JACM)
Communications of the ACM
Algorithm 360: shortest-path forest with topological ordering [H]
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Data structures and algorithms for disjoint set union problems
ACM Computing Surveys (CSUR)
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A shortest path approach to wireframe to solid model conversion
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
An Efficient Algorithm for Finding a Maximum Weight k-Independent Set on Trapezoid Graphs
Computational Optimization and Applications
An experimental study of priority queues in external memory
Journal of Experimental Algorithmics (JEA)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
An optimal parallel algorithm for all-pairs shortest paths on unweighted interval graphs
Nordic Journal of Computing
Optimal roundings of sequences and matrices
Nordic Journal of Computing
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Shortest Path Algorithms: Engineering Aspects
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An Experimental Study of Priority Queues in External Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
LEDA-SM Extending LEDA to Secondary Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
A Simple Shortest Path Algorithm with Linear Average Time
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Location-Based Taxi Service in Wireless Communication Environment
ANSS '03 Proceedings of the 36th annual symposium on Simulation
Route planning and map inference with global positioning traces
Computer Science in Perspective
Δ-stepping: a parallelizable shortest path algorithm
Journal of Algorithms
Simulation in city planning and engineering
Applied system simulation
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Journal of Computer and System Sciences - Special issue: STOC 2003
A 4-geometry maze router and its application on multiterminal nets
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Black box for constant-time insertion in priority queues (note)
ACM Transactions on Algorithms (TALG)
A Concept of Communication Distance and Its Application to Six Situations in Mobile Environments
IEEE Transactions on Mobile Computing
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A Multiple Pairs Shortest Path Algorithm
Transportation Science
A double scaling algorithm for the constrained maximum flow problem
Computers and Operations Research
Proceedings of the 15th international conference on Multimedia
Partial Symbolic Pattern Databases for Optimal Sequential Planning
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Weighted fusion graphs: Merging properties and watersheds
Discrete Applied Mathematics
A new approach for designing fault-tolerant WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Rank-Sensitive Priority Queues
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Manipulation of spatial weights using web services
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Optimal symbolic planning with action costs and preferences
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A statistical service composition approach based on hidden hierarchy Markov model
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A faster algorithm for the single source shortest path problem with few distinct positive lengths
Journal of Discrete Algorithms
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
RECOMB'06 Proceedings of the joint 2006 satellite conference on Systems biology and computational proteomics
An edge-wise linear shortest path algorithm for non negative weighted undirected graphs
Proceedings of the 7th International Conference on Frontiers of Information Technology
Algorithms and theory of computation handbook
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
Minimizing makespan in an ordered flow shop with machine-dependent processing times
Journal of Combinatorial Optimization
Arrival time dependent shortest path by on-road routing in mobile ad-hoc network
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
A faster polynomial algorithm for the constrained maximum flow problem
Computers and Operations Research
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
ACM Transactions on Algorithms (TALG)
QoS-aware automatic service composition: a graph view
Journal of Computer Science and Technology - Special issue on Community Analysis and Information Recommendation
All-pairs shortest paths for unweighted undirected graphs in o(mn) time
ACM Transactions on Algorithms (TALG)
Combining the sweep-line method with the use of an external-memory priority queue
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
Sharing information in all pairs shortest path algorithms
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Efficient algorithms for the all pairs shortest path problem with limited edge costs
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Sharing information for the all pairs shortest path problem
Theoretical Computer Science
| Hi-index | 0.02 |
Efficient implementations of Dijkstra's shortest path algorithm are investigated. A new data structure, called the radix heap, is proposed for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C, a one-level form of radix heap gives a time bound for Dijkstra's algorithm of O(m + n log C). A two-level form of radix heap gives a bound of O(m + n log C/log log C). A combination of a radix heap and a previously known data structure called a Fibonacci heap gives a bound of O(m + na @@@@log C). The best previously known bounds are O(m + n log n) using Fibonacci heaps alone and O(m log log C) using the priority queue structure of Van Emde Boas et al. [ 17].