YADAV, R. VINAY
(2012-05)
Bandwidth is a graph layout problem that is known for its difficulty even on
small graph classes. The bandwidth problem of an arbitrary graph is known to be
NP-complete. It is NP-complete even for a tree of maximum degree ...