Efficient Algorithm for Computing All Low s-t Edge Connectivities in Directed Graphs.
Xiaowei WuChenzi ZhangPublished in: MFCS (2) (2015)
Keyphrases
- directed graph
- single pass
- significant improvement
- undirected graph
- learning algorithm
- np hard
- multiscale
- objective function
- computational complexity
- search space
- expectation maximization
- disjoint paths
- edge detection algorithm
- clustering method
- detection algorithm
- optimization algorithm
- computationally efficient
- particle swarm optimization
- computational cost
- dynamic programming
- preprocessing
- edge detection
- matching algorithm
- probabilistic model
- convergence rate
- strongly connected
- optimal solution