A local graph rewiring algorithm for sampling spanning trees.
Neal McBrideJohn BulavaPublished in: CoRR (2017)
Keyphrases
- spanning tree
- minimum spanning tree
- graph structure
- dynamic programming
- detection algorithm
- k means
- minimum weight
- ant colony optimization
- worst case
- social networks
- graph based algorithm
- times faster
- np hard
- objective function
- bayesian networks
- learning algorithm
- expectation maximization
- simulated annealing
- tree structure
- search space
- computational complexity
- optimal solution
- undirected graph
- random graphs
- depth first search