An O(log n log log n) space algorithm for undirected st-connectivity.
Vladimir TrifonovPublished in: STOC (2005)
Keyphrases
- worst case
- optimization algorithm
- experimental evaluation
- cost function
- significant improvement
- search space
- log log
- optimal solution
- improved algorithm
- computational cost
- expectation maximization
- detection algorithm
- recognition algorithm
- dynamic programming
- matching algorithm
- times faster
- learning algorithm
- theoretical analysis
- data sets
- similarity measure
- preprocessing
- computational complexity
- classification algorithm
- space requirements
- undirected graph
- image segmentation
- connected components
- data structure
- linear programming
- tree structure
- k means
- segmentation algorithm
- np hard
- probabilistic model
- particle swarm optimization
- input data