Topological Bandwidth
- 1 July 1985
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 6 (3), 418-444
- https://doi.org/10.1137/0606044
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- On the Cutwidth and the Topological Bandwidth of a TreeSIAM Journal on Algebraic Discrete Methods, 1985
- Polynomial Time Algorithms for the MIN CUT Problem on Degree Restricted TreesSIAM Journal on Computing, 1985
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problemJournal of Algorithms, 1984
- On eliminating nondeterminism from turing machines which use less than logarithm worktape spaceTheoretical Computer Science, 1982
- The bandwidth problem for graphs and matrices—a surveyJournal of Graph Theory, 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
- One-dimensional logic gate assignment and interval graphsIEEE Transactions on Circuits and Systems, 1979
- Complexity Results for Bandwidth MinimizationSIAM Journal on Applied Mathematics, 1978
- Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse MatricesSIAM Journal on Numerical Analysis, 1976