Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees
- 1 March 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 3 (1), 99-113
- https://doi.org/10.1137/0603010
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- The space complexity of pebble games on treesInformation Processing Letters, 1980
- A Minimum Linear Arrangement Algorithm for Undirected TreesSIAM Journal on Computing, 1979
- Optimal Assignments of Numbers to VerticesJournal of the Society for Industrial and Applied Mathematics, 1964