An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365)

From MaRDI portal
Revision as of 05:37, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
scientific article

    Statements

    An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2005
    0 references
    0 references
    0 references
    0 references
    0 references