An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages (Q4349697)

From MaRDI portal
Revision as of 01:59, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1051488
Language Label Description Also known as
English
An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages
scientific article; zbMATH DE number 1051488

    Statements

    title
    An ‘All Pairs Shortest Paths’ Distributed Algorithm Using 2n2Messages (English)
    0 references
    publication date
    17 December 1997
    0 references
    zbMATH Keywords
    distributed program
    0 references

    Identifiers

    zbMATH DE Number
    1051488
    0 references
    OpenAlex ID
    W2061073017
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4349697&oldid=32898689"
    Powered by MediaWiki