Parallel Algorithms for Depth-First Searches I. Planar Graphs (Q3753502)

From MaRDI portal
Revision as of 19:29, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Parallel Algorithms for Depth-First Searches I. Planar Graphs
scientific article

    Statements

    Parallel Algorithms for Depth-First Searches I. Planar Graphs (English)
    0 references
    0 references
    1986
    0 references
    inherently sequential problems
    0 references
    unbounded-parallel algorithm
    0 references
    depth-first search
    0 references
    planar undirected graph
    0 references
    depth-first spanning tree
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references