Buckets, Heaps, Lists, and Monotone Priority Queues
From MaRDI portal
Publication:4268713
DOI10.1137/S0097539796313490zbMath0926.68092OpenAlexW1978757752MaRDI QIDQ4268713
Craig Silverstein, Boris V. Cherkassky, Andrew V. Goldberg
Publication date: 28 October 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539796313490
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
An optimal algorithm for plane matchings in multipartite geometric graphs, Shortest path reoptimization vs resolution from scratch: a computational comparison, Two compact incremental prime sieves, An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs, Unnamed Item, On Some Special Network Flow Problems: The Shortest Path Tour Problems, Minimum-cost flows in unit-capacity networks, Hybrid Bellman-Ford-Dijkstra algorithm, Spanning trees in multipartite geometric graphs, Complexity analysis and optimization of the shortest path tour problem, An auction-based approach for the re-optimization shortest path tree problem, Integer priority queues with decrease key in constant time and the single source shortest paths problem, A NOVEL LINEAR ALGORITHM FOR SHORTEST PATHS IN NETWORKS, A Survey on Priority Queues, A Forward-Backward Single-Source Shortest Paths Algorithm, Efficient all-UIP learned clause minimization
