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
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
Improved bandwidth approximation for trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
The Complexity of the Approximation of the Bandwidth Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On Approximation Intractability of the Bandwidth Problem
On Approximation Intractability of the Bandwidth Problem
Discrete Applied Mathematics
Discrete Applied Mathematics
Approximating the bandwidth of caterpillars
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Parameterized Complexity
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
| Hi-index | 0.00 |
We give the first polynomial-time algorithm that computes the bandwidth of bipartite permutation graphs. Prior to our work, polynomial-time algorithms for exact computation of bandwidth were known only for caterpillars of hair length 2, chain graphs, cographs, and interval graphs.