A Local Algorithm for the Sparse Spanning Graph Problem.
Christoph LenzenReut LeviPublished in: CoRR (2017)
Keyphrases
- genetic algorithm
- simulated annealing
- search space
- learning algorithm
- graph based algorithm
- graph structure
- detection algorithm
- matching algorithm
- np hard
- preprocessing
- optimal solution
- computational complexity
- dominating set
- cost function
- polynomial time complexity
- depth first search
- weighted graph
- tree structure
- convergence rate
- ant colony optimization
- neural network
- spanning tree
- minimum spanning tree
- graph clustering
- expectation maximization
- theoretical guarantees
- decision trees
- worst case
- probabilistic model