Polynomial time algorithms for the min cut problem on degree restricted trees
SIAM Journal on Computing
A polynomial algorithm for the min-cut linear arrangement of trees
Journal of the ACM (JACM)
Min cut is NP-complete for edge weighted trees
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Graphs with small bandwidth and cutwidth
Discrete Mathematics
On well-partial-order theory and its application to combinatorial problems of VLSI design
SIAM Journal on Discrete Mathematics
Tree-width, path-width, and cutwidth
Discrete Applied 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
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
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 survey of graph layout problems
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Constructive Linear Time Algorithms for Branchwidth
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs
Graph-Theoretic Concepts in Computer Science
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Imbalance is fixed parameter tractable
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Computing the cutwidth of bipartite permutation graphs in linear time
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Known algorithms on graphs of bounded treewidth are probably optimal
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The point-set embeddability problem for plane graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
A branch-and-bound algorithm for the minimum cut linear arrangement problem
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
The cutwidth of a graph G is the smallest integer k such that the vertices of G can be arranged in a linear layout [v"1,...,v"n] in such a way that, for every i=1,...,n-1, there are at most k edges with one endpoint in {v"1,...,v"i} and the other in {v"i"+"1,...,v"n}. In this paper we provide, for any constant k, a linear time algorithm that for any input graph G, answers whether G has cutwidth at most k and, in the case of a positive answer, outputs the corresponding linear layout.