Graph Sketching Against Adaptive Adversaries Applied to the Minimum Degree Algorithm.
Matthew FahrbachGary L. MillerRichard PengSaurabh SawlaniJunxing WangShen Chen XuPublished in: CoRR (2018)
Keyphrases
- graph structure
- learning algorithm
- dominating set
- computational cost
- preprocessing
- minimum cut
- cost function
- np hard
- optimal solution
- dynamic programming
- worst case
- maximum flow
- segmentation algorithm
- neural network
- computational complexity
- graph based algorithm
- random graphs
- shortest path problem
- spanning tree
- recognition algorithm
- directed graph
- matching algorithm
- shortest path
- random walk
- expectation maximization
- simulated annealing
- similarity measure
- significant improvement
- k means
- clustering method
- decision trees
- detection algorithm
- minimum spanning tree