The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
A Note on Dijkstra's Shortest Path Algorithm
Journal of the ACM (JACM)
A Shortest Path Algorithm for Edge-Sparse Graphs
Journal of the ACM (JACM)
Communications of the ACM
ACM '72 Proceedings of the ACM annual conference - Volume 1
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Problem-Solving Methods in Artificial Intelligence
Problem-Solving Methods in Artificial Intelligence
Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
A Study of Pipelining in Computing Arrays
IEEE Transactions on Computers
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
A DAG clustering algorithm for design configurations
ACM '87 Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Faster algorithms for the shortest path problem
Journal of the ACM (JACM)
On minimal closure constraint generation for symbolic cell assembly
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
On the all-pairs-shortest-path problem
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
A Control-Flow Normalization Algorithm and its Complexity
IEEE Transactions on Software Engineering
Efficient parallel algorithms for computing all pair shortest paths in directed graphs
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
An overview of the new routing algorithm for the ARPANET
ACM SIGCOMM Computer Communication Review - Special twenty-fifth anniversary issue. Highlights from 25 years of the Computer Communication Review
Exact solution of large-scale, asymmetric traveling salesman problems
ACM Transactions on Mathematical Software (TOMS)
Graphical information resources: maps and beyond
SIGIR '85 Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval
The Smallest Pair of Noncrossing Paths in a Rectilinear Polygon
IEEE Transactions on Computers
The Journal of Supercomputing
All pairs lightest shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for Selection in X + Y and Other Multisets
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
Optimal paths in graphs with stochastic or multidimensional weights
Communications of the ACM
Optimal surface reconstruction from planar contours
Communications of the ACM
Fast approximation of centrality
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Optimally cutting a surface into a disk
Proceedings of the eighteenth annual symposium on Computational geometry
All pairs shortest paths using bridging sets and rectangular matrix multiplication
Journal of the ACM (JACM)
A multiple-heaps algorithm for parallel simulation of collision systems
Journal of Computational Physics
All-Pairs Shortest Paths Computation in the BSP Model
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Exact and Approximate Distances in Graphs - A Survey
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
All Pairs Shortest Paths in Undirected Graphs with Integer Weights
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An overview of the new routing algorithm for the ARPANET
SIGCOMM '79 Proceedings of the sixth symposium on Data communications
A minimum-impact routing algorithm
DAC '82 Proceedings of the 19th Design Automation Conference
On routing for custom integrated circuits
DAC '82 Proceedings of the 19th Design Automation Conference
Geometric bipartitioning problem and its applications to VLSI
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Toward an automated verification of certificates of authenticity
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Answering distance queries in directed graphs using fast matrix multiplication
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An O (n log n) algorithm for maximum st-flow in a directed planar graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient transitive closure of sparse matrices over closed semirings
Theoretical Computer Science - Algebraic methods in language processing
Planar graphs, negative weight edges, shortest paths, and near linear time
Journal of Computer and System Sciences - Special issue on FOCS 2001
Partitioning graphs to speedup Dijkstra's algorithm
Journal of Experimental Algorithmics (JEA)
Two fast algorithms for all-pairs shortest paths
Computers and Operations Research
Fourier meets möbius: fast subset convolution
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Bridging centrality: graph mining from element level to group level
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Write it recursively: a generic framework for optimal path queries
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Ranking of Closeness Centrality for Large-Scale Social Networks
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Combining heuristic and landmark search for path planning
Future Play '08 Proceedings of the 2008 Conference on Future Play: Research, Play, Share
An O(n log n) algorithm for maximum st-flow in a directed planar graph
Journal of the ACM (JACM)
An online energy-efficient routing protocol with traffic load prospects in wireless sensor networks
International Journal of Sensor Networks
An architecture for routing in the ISO connectionless internet
ACM SIGCOMM Computer Communication Review
Trajectory Compression under Network Constraints
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Weighted A∗ search -- unifying view and application
Artificial Intelligence
ROFL: routing as the firewall layer
Proceedings of the 2008 workshop on New security paradigms
Virtual social networks online and mobile systems
Mobile Information Systems
A global router based on a multicommodity flow model
Integration, the VLSI Journal
ACM Transactions on Algorithms (TALG)
Efficient and scalable multi-geography route planning
Proceedings of the 13th International Conference on Extending Database Technology
Speed-up techniques for shortest-path computations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Solving path problems on the GPU
Parallel Computing
Inconsistent ontology revision based on ontology constructs
Expert Systems with Applications: An International Journal
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Incremental Satisfiability and Implication for UTVPI Constraints
INFORMS Journal on Computing
ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Automatic neuron tracing in volumetric microscopy images with anisotropic path searching
MICCAI'10 Proceedings of the 13th international conference on Medical image computing and computer-assisted intervention: Part II
Learning topological constraints in self-organizing map
ICONIP'10 Proceedings of the 17th international conference on Neural information processing: models and applications - Volume Part II
A language for generic programming in the large
Science of Computer Programming
Quickest paths in anisotropic media
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Finding top-k shortest path distance changes in an evolutionary network
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Representing document as dependency graph for document clustering
Proceedings of the 20th ACM international conference on Information and knowledge management
Exact distance oracles for planar graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A scaling algorithm for maximum weight matching in bipartite graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Approximate shortest paths in weighted graphs
Journal of Computer and System Sciences
A heterogeneous accelerator platform for multi-subject voxel-based brain network analysis
Proceedings of the International Conference on Computer-Aided Design
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Asymmetric inexact matching of spatially-attributed graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Testing structure freeness of regular sets of biomolecular sequences
DNA'04 Proceedings of the 10th international conference on DNA computing
Partitioning graphs to speed up dijkstra's algorithm
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Crossover can provably be useful in evolutionary computation
Theoretical Computer Science
A framework for path-oriented network simplification
IDA'10 Proceedings of the 9th international conference on Advances in Intelligent Data Analysis
Fast and flexible difference constraint propagation for DPLL(T)
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Towards a taxonomy of location based services
W2GIS'05 Proceedings of the 5th international conference on Web and Wireless Geographical Information Systems
Computation of shortest path in cellular automata
Mathematical and Computer Modelling: An International Journal
A Label Correcting Algorithm for the Bus Routing Problem
Fundamenta Informaticae
Journal of Artificial Intelligence Research
Computing all-pairs shortest paths by leveraging low treewidth
Journal of Artificial Intelligence Research
Finding Alternative Shortest Paths in Spatial Networks
ACM Transactions on Database Systems (TODS)
Proceedings of the Winter Simulation Conference
Network infrastructure design with a multilevel algorithm
Expert Systems with Applications: An International Journal
Exploring generative models of tripartite graphs for recommendation in social media
Proceedings of the 4th International Workshop on Modeling Social Media
Map-matched trajectory compression
Journal of Systems and Software
Topology-aware virtual network embedding based on closeness centrality
Frontiers of Computer Science: Selected Publications from Chinese Universities
Fast query structures in anisotropic media
Theoretical Computer Science
Social Link Prediction in Online Social Tagging Systems
ACM Transactions on Information Systems (TOIS)
Quickest path queries on transportation network
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Energy-optimal routes for electric vehicles
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Robust localization from incomplete local information
IEEE/ACM Transactions on Networking (TON)
Approximating the diameter of planar graphs in near linear time
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Shortest-path queries in static networks
ACM Computing Surveys (CSUR)
A memory access model for highly-threaded many-core architectures
Future Generation Computer Systems
Depth-based complexity traces of graphs
Pattern Recognition
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Journal of Discrete Algorithms
Energy Management in Swarm of Unmanned Aerial Vehicles
Journal of Intelligent and Robotic Systems
| Hi-index | 0.05 |
Algorithms for finding shortest paths are presented which are faster than algorithms previously known on networks which are relatively sparse in arcs. Known results which the results of this paper extend are surveyed briefly and analyzed. A new implementation for priority queues is employed, and a class of “arc set partition” algorithms is introduced. For the single source problem on networks with nonnegative arcs a running time of O(min(n1+1/k + e, n + e) log n)) is achieved, where there are n nodes and e arcs, and k is a fixed integer satisfying k 0. This bound is O(e) on dense networks. For the single source and all pairs problem on unrestricted networks the running time is O(min(n2+1/k + ne, n2 log n + ne log n).