Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (Q607658): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Netsoft / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00607-010-0112-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030803509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Shortest Paths in Sparse Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundant intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Algorithm for a Generalization of the Shortest-Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of dynamic graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority queues: Small, monotone and trans-dichotomous / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast priority queues for cached memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination / rank
 
Normal rank

Latest revision as of 11:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
scientific article

    Statements

    Two-level heaps: a new priority queue structure with applications to the single source shortest path problem (English)
    0 references
    0 references
    23 November 2010
    0 references
    single source shortest path
    0 references
    Dijkstra's algorithm
    0 references
    priority queues
    0 references
    two-level heaps
    0 references
    edge relaxation
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references