A fast new algorithm for weak graph regularity.
Jacob FoxLászló Miklós LovászYufei ZhaoPublished in: Comb. Probab. Comput. (2019)
Keyphrases
- minimum spanning tree
- computational cost
- detection algorithm
- dominating set
- computational complexity
- experimental evaluation
- times faster
- graph based algorithm
- recognition algorithm
- high accuracy
- optimization algorithm
- graph construction
- graph model
- matching algorithm
- segmentation algorithm
- dynamic programming
- k means
- learning algorithm
- ant colony optimization
- simulated annealing
- worst case
- spanning tree
- graph partitioning
- cost function
- maximum flow
- optimal solution
- similarity measure