Date: 15 Mar 2002

Coping with the NP-Hardness of the Graph Bandwidth Problem

* Final gross prices may vary according to local VAT.

Get Access


We review several approaches of coping with NP-hardness, and see how they apply (if at all) to the problem of computing the bandwidth of a graph.