Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted Trees
- 1 February 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 14 (1), 158-177
- https://doi.org/10.1137/0214013
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Minimizing width in linear layoutsPublished by Springer Nature ,2005
- On the Cutwidth and the Topological Bandwidth of a TreeSIAM Journal on Algebraic Discrete Methods, 1985
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- Asymptotically tight bounds on time-space trade-offs in a pebble gameJournal of the ACM, 1982
- Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on TreesSIAM Journal on Algebraic Discrete Methods, 1982
- Black-white pebbles and graph separationActa Informatica, 1981
- A dense gate matrix layout method for MOS VLSIIEEE Transactions on Electron Devices, 1980
- The space complexity of pebble games on treesInformation Processing Letters, 1980
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976