An improved Dijkstra's shortest path algorithm for sparse network (Q870157): 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 / describes a project that uses
 
Property / describes a project that uses: Algorithm 360 / 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.1016/j.amc.2006.06.094 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979957675 / 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: Q4234091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4538192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / 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: Q5514188 / 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: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithm for all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for network equilibration / rank
 
Normal rank

Latest revision as of 15:48, 25 June 2024

scientific article
Language Label Description Also known as
English
An improved Dijkstra's shortest path algorithm for sparse network
scientific article

    Statements

    An improved Dijkstra's shortest path algorithm for sparse network (English)
    0 references
    0 references
    12 March 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    Dijkstra's shortest path algorithm
    0 references
    comparison-addition model
    0 references
    Fibonacci heap
    0 references
    numerical examples
    0 references
    sparse networks
    0 references
    road traffic networks
    0 references
    0 references