Distributed CONGEST Algorithm for Finding Hamiltonian Paths in Dirac Graphs and Generalizations.
Noy BitonReut LeviMoti MedinaPublished in: MFCS (2023)
Keyphrases
- cost function
- learning algorithm
- computational complexity
- neural network
- detection algorithm
- dynamic programming
- times faster
- clustering method
- experimental evaluation
- distributed systems
- minimum spanning tree
- optimal path
- undirected graph
- recognition algorithm
- particle swarm optimization
- significant improvement
- k means
- preprocessing
- multi agent
- decision trees
- expectation maximization
- path planning
- distributed environment
- convergence rate
- optimal solution
- weighted graph
- objective function
- path finding