The parallel complexity of approximation algorithms for the maximum acyclic subgraph problem (Q4009810): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism and the feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum flow problem is log space complete for P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered vertex removal and subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model classifying algorithms as inherently sequential with applications to graph searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow Graph Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contraction algorithm for finding small cycle cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lexicographically first maximal subgraph problems:P-completeness andNC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimum cut and maximum flow problems in an acyclic network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a minimum feedback arc set in reducible flow graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets and cyclically reducible graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:41, 16 May 2024

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
    27 September 1992
    0 references
    approximation algorithms
    0 references
    maximum acyclic subgraph problem
    0 references
    EREW PRAM
    0 references
    parallel complexity
    0 references

    Identifiers