Login / Signup

Algorithms for Dense Graphs and Networks on the Random Access Computer.

Joseph CheriyanKurt Mehlhorn
Published in: Algorithmica (1996)
Keyphrases
  • random access
  • graph theory
  • computational complexity
  • graph structures
  • parallel architectures
  • social networks
  • lower bound
  • motion estimation
  • real world networks
  • memory efficient
  • algorithms require