Login / Signup
The Parallel Complexity of Approximating the High Degree Subgraph Problem.
Alexander E. Andreev
Andrea E. F. Clementi
Pierluigi Crescenzi
Elias Dahlhaus
Sergio De Agostino
José D. P. Rolim
Published in:
Theor. Comput. Sci. (1998)
Keyphrases
</>
wide range
search space
decision problems
parallel implementation
databases
high precision
parallel processing
neural network
evolutionary algorithm
worst case
graph mining
power law
computer architecture
parallel programming