Optimal Linear Arrangement of Interval Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Optimal Linear Arrangement of Interval Graphs


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.
Fichier principal
Vignette du fichier
CohenEtAlMFCS06.pdf (241.81 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

inria-00115249 , version 1 (20-11-2006)



Johanne Cohen, Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Gregory Kucherov. Optimal Linear Arrangement of Interval Graphs. 31st International Symposium on Mathematical Foundations of Computer Science - MFCS 2006, Aug 2006, Stara Lesna/Slovakia, pp.267-279, ⟨10.1007/11821069⟩. ⟨inria-00115249⟩
153 View
226 Download



Gmail Facebook Twitter LinkedIn More