Efficient systolic algorithm for finding bridges in a connected graph.
M. ZubairB. B. MadanPublished in: Parallel Comput. (1988)
Keyphrases
- single pass
- computational complexity
- dynamic programming
- computationally efficient
- worst case
- experimental evaluation
- similarity measure
- graph based algorithm
- probabilistic model
- computational cost
- k means
- learning algorithm
- search space
- optimal solution
- high accuracy
- objective function
- maximum flow
- detection algorithm
- tree structure
- matching algorithm
- high efficiency
- bayesian networks
- spanning tree
- np hard
- maximum weight
- shortest path problem
- graph partitioning
- graph model
- optimization algorithm
- segmentation algorithm
- simulated annealing
- preprocessing