Fast Parallel Algorithms for Finding Cutpoints and Bridges of Undirected Graphs.
Stavros D. NikolopoulosStylianos D. DanielopoulosPublished in: Parallel Algorithms Appl. (1994)
Keyphrases
- parallel algorithm
- undirected graph
- parallel computation
- strongly connected
- directed acyclic graph
- directed graph
- pc cluster
- parallel programming
- approximation algorithms
- shared memory
- parallel implementations
- spanning tree
- graph structure
- combinatorial search problems
- multicommodity flow
- parallel version
- discovery of association rules
- interconnection networks
- random graphs
- minimum cost
- disjoint paths
- connected components
- graph cuts
- cluster of workstations
- dynamic programming