Fast, Efficient Parallel Algorithms for Some Graph Problems (Q3932299)

From MaRDI portal
Revision as of 15:28, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast, Efficient Parallel Algorithms for Some Graph Problems
scientific article

    Statements

    Fast, Efficient Parallel Algorithms for Some Graph Problems (English)
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithm
    0 references
    minimum spanning tree
    0 references
    biconnected component
    0 references
    bridge
    0 references
    fundamental cycle
    0 references
    multiprocessing
    0 references
    0 references