An algorithm for finding a short closed spanning walk in a graph.
K. TakamizawaTakao NishizekiNobuji SaitoPublished in: Networks (1980)
Keyphrases
- detection algorithm
- optimal solution
- cost function
- dynamic programming
- experimental evaluation
- high accuracy
- computational complexity
- optimization algorithm
- preprocessing
- particle swarm optimization
- objective function
- graph based algorithm
- shortest path problem
- undirected graph
- graph structure
- recognition algorithm
- random walk
- significant improvement
- learning algorithm
- clustering method
- times faster
- linear programming
- spanning tree
- k means
- method finds
- dominating set