Login / Signup

On the parallel computation of the biconnected and strongly connected co-components of graphs.

Stavros D. NikolopoulosLeonidas Palios
Published in: Discret. Appl. Math. (2007)
Keyphrases
  • parallel computation
  • strongly connected
  • directed graph
  • parallel algorithm
  • parallel processing
  • parallel implementation
  • parallel computing
  • optimum path forest
  • undirected graph
  • parallel programming