Searching for optimal caterpillars in general and bounded treewidth graphs
In this thesis we are interested in optimization problems on caterpillar trees. A caterpillar is a tree with this property that if one removes its leaves only a path is left. The majority of this thesis is devoted to studying the Minimum Spanning Caterpillar Problem (MSCP). An instance of the MSCP i...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
ResearchSpace@Auckland
2011
|
| Online Access: | http://hdl.handle.net/2292/8360 |