Cutwidth I: A linear time fixed parameter algorithm☆,☆☆
References (22)
Improved self-reduction algorithms for graphs with bounded treewidth
Discrete Appl. Math.
(1994)- et al.
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
J. Algorithms
(1996) - et al.
Graphs with small bandwidth and cutwidth
Discrete Math.
(1989) - et al.
On search, decision, and the efficiency of polynomial-time algorithms
J. Comput. System Sci.
(1994) - et al.
Tree-width, path-width, and cutwidth
Discrete Appl. Math.
(1993) - et al.
Min cut is NP-complete for edge weighted trees
Theoret. Comput. Sci.
(1988) - et al.
Graph minors. XIII. The disjoint paths problem
J. Combin. Theory Ser. B
(1995) - et al.
Cutwidth II: Algorithms for partial w-trees of bounded degree
J. Algorithms
(2005) - et al.
Finite automata, bounded treewidth and well-quasiordering
A linear-time algorithm for finding tree-decompositions of small treewidth
SIAM J. Comput.
(1996)
Starting with nondeterminism: the systematic derivation of linear-time graph layout algorithms
Cited by (0)
- ☆
The work of all the authors was supported by the EU project ALCOM-FT (IST-99-14186). The research of the first author was supported by the Spanish CICYT project TIC2000-1970-CE and the Ministry of Education and Culture of Spain (Resolución 31/7/00 – BOE 16/8/00).
- ☆☆
This paper is the full version of part of the paper titled “Constructive linear time algorithms for small cutwidth and carving-width” which appeared in: Proceedings of 11th International Conference ISAAC 2000, Lectures Notes in Comput. Sci., vol. 1969, Springer-Verlag, 2000, pp. 192–203.
Copyright © 2005 Elsevier Inc. All rights reserved.