The Parallel Complexity of Approximating the High Degree Subgraph Problem.

Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, Jos D. P. Rolim

Browse the full ISAAC paper archive.