Analysis of Kelner and Levin graph sparsification algorithm for a streaming setting.
Daniele CalandrielloAlessandro LazaricMichal ValkoPublished in: CoRR (2016)
Keyphrases
- preprocessing
- graph based algorithm
- detection algorithm
- experimental evaluation
- computational complexity
- tree structure
- np hard
- optimization algorithm
- learning algorithm
- worst case
- dynamic programming
- k means
- graph structure
- computational cost
- weighted graph
- minimum spanning tree
- shortest path problem
- probabilistic model
- cost function
- optimal solution
- strongly connected components
- graph construction
- expectation maximization
- undirected graph
- graph model
- segmentation algorithm
- search space
- objective function