Login / Signup

A hierarchical approach to reducing communication in parallel graph algorithms.

HarshvardhanNancy M. AmatoLawrence Rauchwerger
Published in: PPOPP (2015)
Keyphrases
  • computational cost
  • graph theory
  • maximal cliques
  • computationally efficient
  • theoretical analysis
  • depth first search
  • partitioning algorithm
  • learning algorithm
  • hierarchical structures