6 citations · 6 across the 1 of their papers we have counts for
1 paper
Tanya Y. Berger-Wolf, Mitchell A. Harris
The bandwidth of a graph is the labeling of vertices with minimum maximum edge difference. For many graph families this is NP-complete. A classic result computes the bandwidth for…