Optimal linear arrangement of interval graphs

Authors:
Johanne Cohen;Fedor Fomin;Pinar Heggernes;Dieter Kratsch;Gregory Kucherov
Affiliations:
LORIA, Vandoeuvre-lès-Nancy Cedex, France;Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway;LITA, Université de Metz, Metz Cedex 01, France;LIFL/CNRS, Villeneuve d'Ascq, France
Venue:
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Year:
2006

Citing 14
Cited 3

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
Modular decomposition and transitive orientation

Discrete Mathematics - Special issue on partial ordered sets
New approximation techniques for some ordering problems

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Divide-and-conquer approximation algorithms via spreading metrics

Journal of the ACM (JACM)
Approximating the bandwidth via volume respecting embeddings

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
A survey of graph layout problems

ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating Bandwidth by Mixing Layouts of Interval Graphs

SIAM Journal on Discrete Mathematics
The Complexity of the Approximation of the Bandwidth Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Finding hidden independent sets in interval graphs

Theoretical Computer Science
Discovering temporal relations in molecular pathways using protein-protein interactions

RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs

Graph-Theoretic Concepts in Computer Science
Mixed search number and linear-width of interval and split graphs

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Treewidth and minimum fill-in on permutation graphs in linear time

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the optimal linear arrangement (OLA) problem on interval graphs. Several linear layout problems that are NP-hard on general graphs are solvable in polynomial time on interval graphs. We prove that, quite surprisingly, optimal linear arrangement of interval graphs is NP-hard. The same result holds for permutation graphs. We present a lower bound and a simple and fast 2-approximation algorithm based on any interval model of the input graph.