Integer priority queues with decrease key in constant time and the single source shortest paths problem
From MaRDI portal
Publication:5901085
DOI10.1145/780542.780566zbMath1192.90048OpenAlexW2029132631MaRDI QIDQ5901085
Publication date: 16 August 2010
Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/780542.780566
Programming involving graphs or networks (90C35) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05)
Related Items
A new approach to all-pairs shortest paths on real-weighted graphs, Linear-Time Approximation for Maximum Weight Matching, Unnamed Item, Sharing information for the all pairs shortest path problem, A simple reduction from maximum weight matching to maximum cardinality matching, A double scaling algorithm for the constrained maximum flow problem, A faster polynomial algorithm for the constrained maximum flow problem, Improved algorithms for replacement paths problems in restricted graphs, Algebraic Theory on Shortest Paths for All Flows, Engineering Route Planning Algorithms, Maintaining longest paths incrementally
