Parallel Algorithms for Finding the Most Vital Edge in Weighted Graphs.
Sudarshan BanerjeeSanjeev SaxenaPublished in: J. Parallel Distributed Comput. (1997)
Keyphrases
- weighted graph
- parallel algorithm
- shortest path
- parallel computation
- graph structure
- parallel programming
- edge weights
- shared memory
- discrete data
- cluster of workstations
- spanning tree
- regularization framework
- data objects
- pc cluster
- discovery of association rules
- search algorithm
- vertex set
- parallel version
- parallel implementations
- densely connected
- database systems