Login / Signup

A Methodology for Evaluating Parallel Graph Algorithms and Its Application to Single Source Reachability.

Ouri WolfsonWeining ZhangHarish ButaniAkira KawaguchiKui W. Mok
Published in: PDIS (1993)
Keyphrases
  • single source
  • graph theory
  • computational complexity
  • shortest path problem
  • data sets
  • state space
  • worst case
  • computational intelligence
  • depth first search
  • simulated annealing