Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5917573): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1016/j.jcss.2004.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3031415405 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56078254 / 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: Dynamic ordered sets with exponential search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Buckets, Heaps, Lists, and Monotone Priority Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-Route Methods: 1. Reaching, Pruning, and Buckets / 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: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surpassing the information theoretic bound with fusion trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic sorting in O(nloglogn) time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344097 / 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: Undirected single-source shortest paths with positive integer weights in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On RAM Priority Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving order in a forest in less than logarithmic time and linear space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of an efficient priority queue / rank
 
Normal rank

Latest revision as of 14:19, 7 June 2024

scientific article; zbMATH DE number 2116226
Language Label Description Also known as
English
Integer priority queues with decrease key in constant time and the single source shortest paths problem
scientific article; zbMATH DE number 2116226

    Statements

    Integer priority queues with decrease key in constant time and the single source shortest paths problem (English)
    0 references
    0 references
    18 November 2004
    0 references
    Integer priority queues
    0 references
    Decrease key
    0 references
    Fibonacci heaps
    0 references
    Single source shortest paths
    0 references

    Identifiers