Duality in the Bandwidth Problem
- Publication date
- Publisher
Abstract
The bandwidth is an important invariant in graph theory. However, the problem to determine the bandwidth of a general graph is NP-complete. To get sharp bounds, we propose to pay attention to various duality properties or minimax relations related to the bandwidth problem. This paper presents a summary in this point of view