The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810)

From MaRDI portal
Revision as of 14:48, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem
scientific article

    Statements

    The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (English)
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    approximation algorithms
    0 references
    maximum acyclic subgraph problem
    0 references
    EREW PRAM
    0 references
    parallel complexity
    0 references