A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph.
Su-Chu HsuHsien-Fen HsiehShing-Tsaan HuangPublished in: Parallel Comput. (1992)
Keyphrases
- learning algorithm
- weighted graph
- experimental evaluation
- preprocessing
- cost function
- dynamic programming
- computational cost
- depth first search
- undirected graph
- linear array
- genetic algorithm
- breadth first search
- detection algorithm
- k means
- computational complexity
- optimal solution
- expectation maximization
- segmentation algorithm
- optimization algorithm
- np hard
- directed graph
- recognition algorithm
- search space
- random graphs
- graph search
- parallel architecture
- maximum flow
- graph based algorithm
- objective function