An efficient parallel algorithm for shifting the root of a depth first spanning tree (Q3725546)

From MaRDI portal
Revision as of 02:03, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An efficient parallel algorithm for shifting the root of a depth first spanning tree
scientific article

    Statements

    An efficient parallel algorithm for shifting the root of a depth first spanning tree (English)
    0 references
    0 references
    1986
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel computation
    0 references
    depth first spanning tree
    0 references
    root-shifting problem
    0 references
    0 references