Parallel complexity of computing a maximal set of disjoint paths (Q1186594): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 23:38, 4 March 2024

scientific article
Language Label Description Also known as
English
Parallel complexity of computing a maximal set of disjoint paths
scientific article

    Statements

    Parallel complexity of computing a maximal set of disjoint paths (English)
    0 references
    0 references
    28 June 1992
    0 references
    parallel complexity
    0 references
    maximal path problem
    0 references
    depth-first search
    0 references
    NC
    0 references
    PRAMs
    0 references
    polylogarithmic time
    0 references

    Identifiers