A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs

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.