Conference paper
An Arabic Slot Grammar parser
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
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.
Michael C. McCord, Violetta Cavalli-Sforza
ACL 2007
B. Wagle
EJOR
Thomas M. Cover
IEEE Trans. Inf. Theory
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking