A fast new algorithm for weak graph regularity.
Jacob FoxLászló Miklós LovászYufei ZhaoPublished in: CoRR (2018)
Keyphrases
- dynamic programming
- learning algorithm
- graph structure
- computational cost
- detection algorithm
- times faster
- cost function
- optimal solution
- significant improvement
- np hard
- matching algorithm
- worst case
- optimization algorithm
- dominating set
- maximum flow
- segmentation algorithm
- high accuracy
- preprocessing
- expectation maximization
- graphical models
- simulated annealing
- experimental evaluation
- k means
- lower bound
- random graphs
- graph theoretical
- solution path
- neural network