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
A branch-and-cut algorithm for the equicut problem
Mathematical Programming: Series A and B
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Minimizing Width in Linear Layouts
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
Solving Graph Bisection Problems with Semidefinite Programming
INFORMS Journal on Computing
Cutwidth I: A linear time fixed parameter algorithm
Journal of Algorithms
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Fixed-parameter algorithms for protein similarity search under mRnA structure constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
A new branch and bound algorithm for the cyclic bandwidth problem
MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Computational Intelligence - Volume Part II
Hi-index | 0.00 |
Given an edge-weighted graph G of order n, the minimum cut linear arrangement problem (MCLAP) asks to find a one-to-one map from the vertices of G to integers from 1 to n such that the largest of the cut values c 1,驴,c n驴1 is minimized, where c i , i驴{1,驴,n驴1}, is the total weight of the edges connecting vertices mapped to integers 1 through i with vertices mapped to integers i+1 through n. In this paper, we present a branch-and-bound algorithm for solving this problem. A salient feature of the algorithm is that it employs a dominance test which allows reducing the redundancy in the enumeration process drastically. The test is based on the use of a tabu search procedure developed to solve the MCLAP. We report computational results for both the unweighted and weighted graphs. In particular, we focus on calculating the cutwidth of some well-known graphs from the literature.