Efficiently parallelizable problems on a class of decomposable graphs (Q1765226)

From MaRDI portal
Revision as of 09:41, 11 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficiently parallelizable problems on a class of decomposable graphs
scientific article

    Statements

    Efficiently parallelizable problems on a class of decomposable graphs (English)
    0 references
    0 references
    23 February 2005
    0 references
    Decomposable graphs
    0 references
    Parallel algorithms
    0 references
    PRAM
    0 references
    Subgraph optimization problems
    0 references
    Rooted trees
    0 references
    Series-parallel graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references