Minimum Degree Spanning Trees on Bipartite Permutation Graphs
The minimum degree spanning tree problem is a widely studied NP-hard variation of the minimum spanning tree problem, and a generalization of the Hamiltonian path problem. Most of the work done on the minimum degree spanning tree problem has been on approximation algorithms, and very little work has...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10048/1900 |