Paper Info
Title
The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem
Abstract
Several classes of sequential algorithms to approximate themaximum acyclic subgraph problem are examined. The equivalentfeedback arc set problem isNP-complete and there are only a few classes of graphs for which it is known to be inP. Thus, approximation algorithms are very important for this problem. Our goal is to determine how effectively the various sequential algorithms parallelize. Of the sequential algorithms we study, natural decision problems based on several of them are provedP-complete. Parallel implementations usingO(log ¦V¦) time and ¦E¦ processors on an EREW PRAM exist for the other algorithms. Interestingly, the parallelizable algorithms appear very similar to some of theinherently sequential algorithms. Thus, for approximating the maximum acyclic subgraph problem small algorithmic changes drastically alter parallel complexity, unlessNC equalsP.
Year
DOI
Venue
1992
10.1007/BF01374523
Theory of Computing Systems / Mathematical Systems Theory
Keywords
Field
DocType
Computational Mathematic,Approximation Algorithm,Decision Problem,Parallel Implementation,Sequential Algorithm
Analysis of parallel algorithms,Approximation algorithm,Discrete mathematics,Combinatorics,Decision problem,Maximum common subgraph isomorphism problem,Algorithm,Directed graph,Induced subgraph isomorphism problem,Probabilistic analysis of algorithms,Sequential algorithm,Mathematics
Journal
Volume
Issue
ISSN
25
3
0025-5661
Citations 
PageRank 
References 
2
0.70
12
Authors
1
Name
Order
Citations
PageRank
Raymond Greenlaw114218.56