A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs.
Jørgen Bang-JensenYannis ManoussakisCarsten ThomassenPublished in: J. Algorithms (1992)
Keyphrases
- learning algorithm
- dynamic programming
- cost function
- objective function
- optimization algorithm
- theoretical analysis
- improved algorithm
- k means
- expectation maximization
- times faster
- experimental evaluation
- tree structure
- computational cost
- graph structure
- linear programming
- np hard
- undirected graph
- computational complexity
- detection algorithm
- matching algorithm
- convergence rate
- polynomially bounded
- neural network
- particle swarm optimization
- worst case
- probabilistic model
- evolutionary algorithm
- preprocessing
- optimal solution