Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
暂无分享,去创建一个
Maria J. Serna | Dimitrios M. Thilikos | Hans L. Bodlaender | D. Thilikos | H. Bodlaender | M. Serna
[1] Michael R. Fellows,et al. On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..
[2] Fan Chung,et al. ON THE CUTWIDTH AND THE TOPOLOGICAL BANDWIDTH OF A TREE , 1985 .
[3] Hans L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.
[4] Fillia Makedon,et al. On minimizing width in linear layouts , 1989, Discret. Appl. Math..
[5] Ivan Hal Sudborough,et al. Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.
[6] Joseph Naor,et al. Divide-and-conquer approximation algorithms via spreading metrics , 2000, JACM.
[7] Hans L. Bodlaender. Improved Self-reduction Algorithms for Graphs with Bounded Treewidth , 1994, Discret. Appl. Math..
[8] Michael R. Fellows,et al. Finite automata, bounded treewidth, and well-quasiordering , 1991, Graph Structure Theory.
[9] Hans L. Bodlaender,et al. A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.
[10] Fillia Makedon,et al. Topological Bandwidth , 1983, CAAP.
[11] Paul D. Seymour,et al. Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.
[12] Paul D. Seymour,et al. Graphs with small bandwidth and cutwidth , 1989, Discret. Math..
[13] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[14] YannakakisMihalis. A polynomial algorithm for the min-cut linear arrangement of trees , 1985 .
[15] Dimitrios M. Thilikos,et al. Constructive Linear Time Algorithms for Branchwidth , 1997, ICALP.
[16] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[17] Robin Thomas,et al. Call routing and the ratcatcher , 1994, Comb..
[18] Samir Khuller,et al. Designing Multi-Commodity Flow Trees , 1994, Inf. Process. Lett..
[19] Michael R. Fellows,et al. On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.
[20] Mihalis Yannakakis,et al. A polynomial algorithm for the MIN CUT linear arrangement of trees , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[21] Ton Kloks,et al. Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.
[22] Ephraim Korach,et al. Tree-Width, Path-Widt, and Cutwidth , 1993, Discret. Appl. Math..