A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs.
Viresh PatelFabian StrohPublished in: CoRR (2020)
Keyphrases
- worst case
- optimal solution
- graph isomorphism
- computational complexity
- dynamic programming
- preprocessing
- optimization algorithm
- special case
- expectation maximization
- learning algorithm
- segmentation algorithm
- matching algorithm
- convergence rate
- detection algorithm
- graph model
- cost function
- objective function
- weighted graph
- graph structure
- graph partitioning
- adjacency graph
- polynomial time complexity
- linear programming
- clustering method
- particle swarm optimization
- simulated annealing
- computational cost
- k means
- search space
- association rules
- similarity measure