An $0(n \log n)$ Algorithm for Bandwidth of Interval Graphs

Authors:
Alan P. Sprague
Affiliations:
-
Venue:
SIAM Journal on Discrete Mathematics
Year:
1994

Citing 0
Cited 19

A survey of graph layout problems

ACM Computing Surveys (CSUR)
Bandwidth of Split and Circular Permutation Graphs

WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete

Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Graph bandwidth of weighted caterpillars

Theoretical Computer Science - Algorithmic applications in management
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs

SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Bandwidth of bipartite permutation graphs in polynomial time

Journal of Discrete Algorithms
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs

Discrete Applied Mathematics
Hardness and approximation of minimum distortion embeddings

Information Processing Letters
Approximating bandwidth by mixing layouts of interval graphs

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hardness results for approximating the bandwidth

Journal of Computer and System Sciences
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs

Theoretical Computer Science
Bandwidth of convex bipartite graphs and related graphs

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Graph bandwidth of weighted caterpillars

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Optimal linear arrangement of interval graphs

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Bandwidth of convex bipartite graphs and related graphs

Information Processing Letters
Approximability of the path-distance-width for AT-free graphs

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
An exponential time 2-approximation algorithm for bandwidth

Theoretical Computer Science
Approximating the path-distance-width for AT-free graphs and graphs in related classes

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an $0(n \log n)$ algorithm for the bandwidth problem on interval graphs. Given an interval model for an interval graph with $n$ vertices and an integer $k$, the algorithm constructs a layout of bandwidth at most $k$, if there exists one. Two previous algorithms for this problem have been published. One of them is flawed; the other is by Kleitman and Vohra and has complexity $O(nk)$.