Two fast algorithms for all-pairs shortest paths (Q875428): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q531431
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cees W. Duin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 97 / 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.cor.2005.10.013 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1985732996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graph decomposition and all pairs shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction tests for the steiner problem in grapsh / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / 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: A branch-checking algorithm for all-pairs shortest paths / 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: Finding the Hidden Path: Time Bounds for All-Pairs Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-pairs shortest paths and the essential subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to all-pairs shortest paths on real-weighted graphs / 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: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All shortest distances in a graph. An improvement to Dantzig's inductive algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths algorithms: Theory and experimental evaluation / rank
 
Normal rank

Latest revision as of 16:13, 25 June 2024

scientific article
Language Label Description Also known as
English
Two fast algorithms for all-pairs shortest paths
scientific article

    Statements

    Two fast algorithms for all-pairs shortest paths (English)
    0 references
    13 April 2007
    0 references
    0 references

    Identifiers