An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220)

From MaRDI portal
Revision as of 05:09, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An efficient parallel algorithm for shortest paths in planar layered digraphs
scientific article

    Statements

    title
    An efficient parallel algorithm for shortest paths in planar layered digraphs (English)
    0 references
    author
    Roberto Tamassia
    0 references
    Jeffrey Scott Vitter
    0 references
    Sairam Subramanian
    0 references
    published in
    Algorithmica
    0 references
    publication date
    18 March 1996
    0 references
    zbMATH Keywords
    shortest paths
    0 references
    directed graph
    0 references
    planar layered digraphs
    0 references

    Identifiers

    DOI
    10.1007/BF01294130
    0 references
    Mathematics Subject Classification ID
    68W15
    0 references
    68Q25
    0 references
    68R10
    0 references
    zbMATH DE Number
    803318
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1899220&oldid=26579689"
    Powered by MediaWiki