A decomposition procedure for finding the minimal Hamiltonian chain of a sparse graph
The problem considered here is one of finding the minimal Hamiltonian chain of a graph. A single chain must traverse all 𝑛 vertices of a graph with the minimal distance. The proposed procedure reduces a large problem into several smaller problems and uses a branch and bound algorithm to find the min...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Virginia Polytechnic Institute and State University
2016
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/64663 |