An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph
Rohan F. M. AranhaC. Pandu RanganPublished in: J. Univers. Comput. Sci. (1995)
Keyphrases
- computational complexity
- detection algorithm
- optimal solution
- search space
- learning algorithm
- similarity measure
- objective function
- preprocessing
- computationally efficient
- computational cost
- particle swarm optimization
- minimum spanning tree
- shortest path problem
- graph model
- clustering method
- adjacency graph
- graph based algorithm
- breadth first search
- multi agent
- spanning tree
- data structure
- graph structure
- segmentation algorithm
- cost function
- np hard
- k means
- dynamic programming
- tree structure
- matching algorithm
- directed graph
- random walk
- graph cuts
- expectation maximization
- neural network
- image segmentation
- distributed systems
- worst case