An optimal distributed algorithm for finding articulation points in a network.
Pranay ChaudhuriPublished in: Comput. Commun. (1998)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- computational complexity
- cost function
- detection algorithm
- peer to peer
- k means
- computational cost
- simulated annealing
- method finds
- significant improvement
- preprocessing
- probabilistic model
- np hard
- particle swarm optimization
- communication overhead
- exhaustive search
- reinforcement learning
- delaunay triangulation
- optimal path
- globally optimal
- communication cost
- convex hull
- matching algorithm
- expectation maximization
- search space
- genetic algorithm