An almost-linear time algorithm for uniform random spanning tree generation.
Aaron SchildPublished in: STOC (2018)
Keyphrases
- spanning tree
- np hard
- computational complexity
- objective function
- optimal solution
- minimum spanning tree
- uniform random
- learning algorithm
- distance transform
- segmentation algorithm
- worst case
- lower bound
- tree structure
- constraint satisfaction
- qualitative and quantitative
- probabilistic model
- discrete tomography
- video sequences