Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
type: Item
instance of: scholarly article
title: Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
zbMATH Open document ID: 1211.68135
author: Kamesh Madduri
author: K. Subramani
published in: Computing
publication date: 2010-11-23T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 5818347
zbMATH Keywords: single source shortest path
zbMATH Keywords: Dijkstra's algorithm
zbMATH Keywords: priority queues
zbMATH Keywords: two-level heaps
zbMATH Keywords: edge relaxation
describes a project that uses: DIMACS
describes a project that uses: Netsoft
MaRDI profile type: Publication
full work available at URL: s00607-010-0112-1
OpenAlex ID: W2030803509
cites work: Faster algorithms for the shortest path problem
cites work: Worst case constant time priority queue
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: A note on two problems in connexion with graphs
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Q4474117
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
cites work: Irredundant intervals
cites work: Single-source shortest-paths on arbitrary directed graphs in linear average-case time
cites work: An Incremental Algorithm for a Generalization of the Shortest-Path Problem
cites work: On the computational complexity of dynamic graph problems
cites work: Priority queues: Small, monotone and trans-dichotomous
cites work: Fast priority queues for cached memory
cites work: Q4875169
cites work: Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
DOI: 10.1007/S00607-010-0112-1
description: scientific article; zbMATH DE number 5818347