A polynomial algorithm for the min-cut linear arrangement of trees
Journal of the ACM (JACM)
On minimizing width in linear layouts
Discrete Applied Mathematics
On well-partial-order theory and its application to combinatorial problems of VLSI design
SIAM Journal on Discrete Mathematics
Improved self-reduction algorithms for graphs with bounded treewidth
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
A partial k-arboretum of graphs with bounded treewidth
Theoretical Computer Science
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Linear Layouts of Generalized Hypercubes
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Polynomial time algorithms for the MIN CUT problem on degree restricted trees
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Using DPLL for efficient OBDD construction
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
The cutwidth of a graph G is defined as the smallest integer k such that the vertices of G can be arranged in a vertex ordering [v1, . . vn] in a way that, for every i = 1, . . . n - 1, there are at most k edges with the one endpoint in {v1, . . .. vi} and the other in {vi+1, . . . vn}. We examine the problem of computing in polynomial time the cutwidth of a partial w-tree with bounded degree. In particular, we show how to construct an algorithm that, in nO(w2d) steps, computes the cutwidth of any partial w-tree with vertices of degree bounded by a fixed constant d. Our algorithm is constructive in the sense that it can be adapted to output the corresponding optimal vertex ordering. Also, it is the main subroutine of an algorithm computing the pathwidth of a bounded degree partial w-tree in nO((wd)2) steps.