Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem

Chung, 1982, Polynomial algorithms for the min-cut linear arrangement problem on degree restricted trees, 262

Garey, 1978, Complexity results for bandwidth minimization, SIAM J. Appl. Math., 34, 477, 10.1137/0134037

F. Gavril, Some NP-complete problems on graphs, in Proceedings 11th Annual Conference on Information Sciences and Systems, The Johns Hopkins University, Baltimore, pp. 91–95.

Gurari, 1981, Cutwidth problems in graphs, 752

Lengauer, 1982, Upper and lower bounds on the complexity of the Min-Cut Linear Arrangement problem on trees, SIAM J. Algebraic Discrete Methods, 10.1137/0603010

Loui, 1976, Comparative analysis of the Cuthill-McKee ordering algorithms for sparse matrices, SIAM J. Numer. Anal.

Makedon, 1983, Topological bandwidth, Vol. 159, 317

Makedon, 1983, Minimizing width in linear layouts, Vol. 154

Monien, 1980, Bandwidth problems in graphs, 650

Papadimitriou, 1976, The NP-completeness of the bandwidth minimization problem, Computing, 16, 237, 10.1007/BF02280884

Savitch, 1970, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci., 4, 177, 10.1016/S0022-0000(70)80006-X

Saxe, 1980, Dynamic-programming algorithms for recognizing small bandwidth graphs in polynomial time, SIAM J. Algebraic Discrete Methods, 10.1137/0601042

Stockmeyer, 1979

Trimberg, 1982, Automating chip layout, IEEE Spectrum, 38

Weinberger, 1967, Large scale integration of MOS complex logic: A layout method, IEEE J. Solid State Circuits, SC-2, 182, 10.1109/JSSC.1967.1049816

Yannakakis, 1983, A polynomial algorithm for the min cut linear arrangement of trees, 274