Graph Sketching against Adaptive Adversaries Applied to the Minimum Degree Algorithm.
Matthew FahrbachGary L. MillerRichard PengSaurabh SawlaniJunxing WangShen Chen XuPublished in: FOCS (2018)
Keyphrases
- learning algorithm
- detection algorithm
- computational complexity
- computational cost
- graph based algorithm
- k means
- random graphs
- dynamic programming
- segmentation algorithm
- square error
- preprocessing
- matching algorithm
- social networks
- shortest path problem
- spanning tree
- recognition algorithm
- clustering method
- optimization algorithm
- simulated annealing
- worst case
- cost function
- search algorithm
- dominating set
- search space
- maximum flow
- recursive least squares
- depth first search
- significant improvement
- minimum spanning tree
- graph partitioning
- weighted graph
- bipartite graph
- convergence rate
- tree structure