The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem

Raymond Greenlaw. The Parallel Complexity of Approximation Algorithms for the Maximum Acyclic Subgraph Problem. Theory Comput. Syst., 25(3):161-175, 1992.

Abstract

Abstract is missing.