Tree-based decompositions of graphs on surfaces and applications to the traveling salesman problem
The tree-width and branch-width of a graph are two well-studied examples of parameters that measure how well a given graph can be decomposed into a tree structure. In this thesis we give several results and applications concerning these concepts, in particular if the graph is embedded on a surface....
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/22583 |