Fully dynamic algorithm for graph spanners with poly-logarithmic update time.
Surender BaswanaSoumojit SarkarPublished in: SODA (2008)
Keyphrases
- dynamic programming
- worst case
- optimal solution
- learning algorithm
- matching algorithm
- preprocessing
- graph based algorithm
- simulated annealing
- experimental evaluation
- times faster
- tree structure
- high accuracy
- shortest path problem
- cost function
- computational complexity
- minimum spanning tree
- probabilistic model
- significant improvement
- segmentation algorithm
- lower bound
- adjacency graph
- graph structure
- dominating set
- graph theoretical
- graph partitioning
- weighted graph
- recognition algorithm
- detection algorithm
- random walk
- computational cost
- np hard
- k means
- search space
- objective function
- image segmentation