The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete
SIAM Journal on Algebraic and Discrete Methods
Computing the bandwidth of interval graphs
SIAM Journal on Discrete Mathematics
Bandwidth of theta graphs with short paths
Discrete Mathematics
An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs
SIAM Journal on Discrete Mathematics
Dominating cliques in chordal graphs
Discrete Mathematics
Restrictions of minimum spanner problems
Information and Computation
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Information Processing Letters
The Complexity of the Approximation of the Bandwidth Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Approximating bandwidth by mixing layouts of interval graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
Graph Theory, Computational Intelligence and Thought
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences
Theoretical Computer Science
| Hi-index | 0.00 |
The BANDWIDTH minimization problem on graphs of some special graph classes is studied and the following results are obtained. The problem remains NP-complete when restricted to splitgraphs. There is a linear time algorithm to compute the exact bandwidth of a subclass of splitgraphs called hedgehogs. There is an efficient algorithm to approximate the bandwidth of circular permutation graphs within a factor of four.