New Results on Combinatorial Algorithms
In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). The problem of determining the maximum number of node-disjoint subgraphs of a partial k-t