A Linear Systolic Algorithm for Finding Bridges on an Undirected Connected Graph.
Hsien-Fen HsiehShing-Tsaan HuangSu-Chu HsuPublished in: ICPP (1) (1990)
Keyphrases
- dynamic programming
- undirected graph
- weighted graph
- cost function
- graph based algorithm
- matching algorithm
- k means
- optimization algorithm
- learning algorithm
- piecewise linear
- directed graph
- detection algorithm
- preprocessing
- computational complexity
- worst case
- simulated annealing
- probabilistic model
- ant colony optimization
- search space
- recognition algorithm
- graph structure
- objective function
- shortest path problem
- maximum clique
- polynomial time complexity
- maximum flow
- neighborhood graph
- dominating set
- linear complexity
- directed acyclic graph
- tree structure
- segmentation algorithm
- np hard
- significant improvement
- similarity measure