An O(m log log D) algorithm for shortest paths (Q1053460): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56078247 / 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: An O(m log D) algorithm for shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A priority queue in which initialization and queue operations takeO(loglogD) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and implementation of an efficient priority queue / 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

Latest revision as of 09:54, 14 June 2024

scientific article
Language Label Description Also known as
English
An O(m log log D) algorithm for shortest paths
scientific article

    Statements