Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
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.
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010
B.K. Boguraev, Mary S. Neff
HICSS 2000
Corneliu Constantinescu
SPIE Optical Engineering + Applications 2009
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev