An Asymptotically Fast Polynomial Space Algorithm for Hamiltonicity Detection in Sparse Directed Graphs.
Andreas BjörklundPublished in: STACS (2021)
Keyphrases
- detection algorithm
- dynamic programming
- directed graph
- learning algorithm
- optimization algorithm
- preprocessing
- worst case
- detection method
- search space
- k means
- significant improvement
- np hard
- high dimensional
- computational complexity
- optimal solution
- objective function
- maximum flow
- undirected graph
- graph structure
- sparse matrix
- matching algorithm
- expectation maximization
- particle swarm optimization
- cost function
- clustering algorithm