Bandwidth of convex bipartite graphs and related graphs

Authors:
Anish Man Singh Shrestha;Satoshi Tayu;Shuichi Ueno
Affiliations:
Department of Communications and Integrated Systems, Tokyo Institute of Technology, 2-12-1-S3-57 Ookayama, Meguro-ku, Tokyo, Japan;Department of Communications and Integrated Systems, Tokyo Institute of Technology, 2-12-1-S3-57 Ookayama, Meguro-ku, Tokyo, Japan;Department of Communications and Integrated Systems, Tokyo Institute of Technology, 2-12-1-S3-57 Ookayama, Meguro-ku, Tokyo, Japan
Venue:
Information Processing Letters
Year:
2012

Citing 12
Cited 0

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
An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs

SIAM Journal on Discrete Mathematics
Graph classes: a survey

Graph classes: a survey
Bandwidth of chain graphs

Information Processing Letters
Approximating the Bandwidth for Asteroidal Triple-Free Graphs

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Bandwidth of Bipartite Permutation Graphs

ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Bandwidth of bipartite permutation graphs in polynomial time

Journal of Discrete Algorithms
Bipartite permutation graphs

Discrete Applied Mathematics
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
On orthogonal ray graphs

Discrete Applied Mathematics
Hardness results for approximating the bandwidth

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that the bandwidth problem is NP-complete for convex bipartite graphs. We provide an O(n)-time, 4-approximation algorithm and an O(nlog^2n)-time, 2-approximation algorithm to compute the bandwidth of convex bipartite graphs with n vertices. We also consider 2-directional orthogonal ray graphs, a superclass of convex bipartite graphs, for which we provide an O(n^2logn)-time, 3-approximation algorithm, where n is the number of vertices.