A randomized polynomial-time algorithm for the Spanning Hypertree Problem on 3-uniform hypergraphs
Sergio CaraccioloGregor MasbaumAlan D. SokalAndrea SportielloPublished in: CoRR (2008)
Keyphrases
- computational complexity
- experimental evaluation
- worst case
- optimization algorithm
- cost function
- dynamic programming
- clustering method
- detection algorithm
- k means
- high accuracy
- learning algorithm
- particle swarm optimization
- linear programming
- computational cost
- np hard
- neural network
- simulated annealing
- significant improvement
- preprocessing
- theoretical analysis
- objective function
- similarity measure
- convergence rate
- expectation maximization
- recognition algorithm