title: Minimum Bandwidth Problem
body: <p>I'm interesting the NP-complete "minimum bandwidth" problem for finding the minimum bandwidth of a graph. For those not familiar, here is a link about it...</p>
  
  <p><a href="http://en.wikipedia.org/wiki/Graph_bandwidth" rel="nofollow">http://en.wikipedia.org/wiki/Graph_bandwidth</a></p>
  
  <p>I've implemented the Cuthill-McKee algorithm, and this was very successful at giving me a permutation of the vertices in which the bandwidth was <strong><em>reduced</em></strong>; however, I'm looking for the <strong><em>minimum bandwidth</em></strong>, not just a reduced bandwidth that is close. If any of you have experience with this problem, what algorithms provide solutions that are the <strong><em>minimum</em></strong> and not just <strong><em>reduced</em></strong>? I don't need actual implementation of any algorithm, I just want suggestions for what algorithms to research that yield actual <strong><em>minimum bandwidths</em></strong>.</p>