Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
The pathwidth and treewidth of cographs
SIAM Journal on Discrete Mathematics
The vertex separation and search number of a graph
Information and Computation
Obstruction set isolation for the gate matrix layout problem
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Triangulating graphs without asteroidal triples
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Triangulating multitolerance graphs
Discrete Applied Mathematics
All structured programs have small tree width and good register allocation
Information and Computation
Linear-time register allocation for a fixed number of registers
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Tree Decompositions of Small Diameter
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
The Treewidth of Java Programs
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Tree decompositions with small cost
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
| Hi-index | 0.00 |
Motivated by the desire to speed up dynamic programming algorithms for graphs of bounded treewidth, we initiate a study of the tradeoff between width and pathwidth of tree-decompositions. We therefore investigate the catwidth parameter catw(G) which is the minimum width of any tree-decomposition (T,X) of a graph G when the pathwidth pw(T) of the tree T is 1. The catwidth parameter lies between the treewidth and the pathwidth of the graph, tw(G)=