A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs.
Viresh PatelFabian StrohPublished in: SIAM J. Discret. Math. (2022)
Keyphrases
- cost function
- worst case
- graph isomorphism
- computational cost
- learning algorithm
- optimal solution
- np hard
- segmentation algorithm
- computational complexity
- polynomial time complexity
- matching algorithm
- particle swarm optimization
- detection algorithm
- linear programming
- dynamic programming
- special case
- k means
- preprocessing
- expectation maximization
- shortest path
- clustering method
- graph structure
- stereo correspondence
- strongly polynomial