Abstract
A graph H = (W, E-H) is said to have bandwidth at most b if there exists a labeling of W as w(1), w(2), . . . , w(n) such that vertical bar i - j vert......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
