An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs.
Andreas BjörklundPublished in: CoRR (2020)
Keyphrases
- detection algorithm
- directed graph
- detection method
- dynamic programming
- learning algorithm
- maximum flow
- objective function
- cost function
- optimization algorithm
- computational complexity
- optimal solution
- expectation maximization
- segmentation algorithm
- k means
- np hard
- preprocessing
- undirected graph
- clustering method
- matching algorithm
- high dimensional
- probabilistic model
- genetic algorithm
- simulated annealing
- search space