Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations.
Noy BitonReut LeviMoti MedinaPublished in: CoRR (2023)
Keyphrases
- cost function
- learning algorithm
- computational cost
- preprocessing
- experimental evaluation
- matching algorithm
- k means
- undirected graph
- search space
- dynamic programming
- times faster
- detection algorithm
- optimal solution
- similarity measure
- optimization algorithm
- distributed systems
- graph model
- graph structure
- convergence rate
- path planning
- path finding
- tree structure
- clustering method
- segmentation algorithm
- expectation maximization
- knn
- probabilistic model
- significant improvement
- image segmentation