Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
Consider the following problem: For any constant k and any input graph G, check whether there exists a tree T with internal vertices of degree 3 and a bijection x mapping the vertices of G to the leaves of T such that for any edge of T, the number of edges of G whose end- points have preimages in different components of T -e, is bounded by k. This problem is known as the Minimum Routing Tree Congestion problem and is relevant to the design of minimum congestion telephone networks. If, in the above definition, we consider lines instead of trees with internal vertices of degree 3 and bijections mapping the vertices of G to all the vertices of T, we have the well known Minimum Cut Linear Arrangement problem. Recent results of the Graph Minor series of Robertson and Seymour imply (non-constructively) that both these problems are fixed parameter tractable. In this paper we give a constructiveproof of this fact. Moreover, the algorithms of our proof are optimal and able to output the corresponding pair (T,x) in case of an affirmative answer.
Unable to display preview. Download preview PDF.
- 1.K. R. Abrahamson and M. R. Fellows. Finite automata, bounded treewidth and well-quasiordering. In N. Robertson and P. Seymour, editors, Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147, pages 539–564. American Mathematical Society, 1993.Google Scholar
- 5.H. L. Bodlaender and D. M. Thilikos. Constructive linear time algorithms for branchwidth. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, Proceedings 24th International Colloquium on Automata, Languages, and Programming, ICALP’97, pages 627–637. Springer-Verlag, Lecture Notes in Computer Science, Vol. 1256, 1997.Google Scholar
- 6.H. L. Bodlaender and D. M. Thilikos. Computing small search numbers in linear time. Technical Report Technical Report No. UU-CS-1998-05, Dept. of Computer Science, Utrecht University, 1998.Google Scholar
- 9.G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. In Proc. 36th Symp. on Foundations of Computer Science (FOCS), pages 62–71, 1995.Google Scholar
- 13.S. Khuller, B. Raghavachari, and N. Young. Designing multi-commodity flow trees. Inform. Proc. Letters, 50:49–55, 1994.Google Scholar
- 18.N. Robertson and P. D. Seymour. Graph minors. XXIII. the Nash-Williams immersion conjecture. To appear.Google Scholar