Login / Signup

The Parallel Complexity of Approximating the High Degree Subgraph Problem.

Alexander E. AndreevAndrea E. F. ClementiPierluigi CrescenziElias DahlhausSergio De AgostinoJosé D. P. Rolim
Published in: ISAAC (1995)
Keyphrases
  • wide range
  • parallel processing
  • data sets
  • computational complexity
  • case study
  • worst case
  • low degree
  • information systems
  • decision problems
  • graph matching
  • parallel implementation
  • parallel computation