A Local Algorithm for Constructing Spanners in Minor-Free Graphs.
Reut LeviDana RonRonitt RubinfeldPublished in: APPROX-RANDOM (2016)
Keyphrases
- preprocessing
- times faster
- cost function
- high accuracy
- improved algorithm
- detection algorithm
- computationally efficient
- graph isomorphism
- matching algorithm
- computational cost
- dynamic programming
- experimental evaluation
- significant improvement
- k means
- minimum spanning tree
- similarity measure
- optimal solution
- optimization algorithm
- neural network
- expectation maximization
- theoretical analysis
- clustering method
- directed graph
- convergence rate
- graph structure
- input data
- linear programming
- graph search
- subgraph isomorphism
- learning algorithm