Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
A graph is said to be of bandwidth 2 if its vertices can be laid out linearly such that the maximum distance between vertices adjacent in the graph does not exceed 2. The bandwidth concept has applications to VLSI layout, matrix processing, memory management for data structures, and more. We develop a constructive, simple, linear-time algorithm for deciding whether a given biconnected graph is of bandwidth 2. © 1993.
Arun Viswanathan, Nancy Feldman, et al.
IEEE Communications Magazine
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Maurice Hanan, Peter K. Wolff, et al.
DAC 1976