HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Optimal Linear Arrangement of Interval Graphs

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

Contributor : Gregory Kucherov Connect in order to contact the contributor
Submitted on : Monday, November 20, 2006 - 5:15:34 PM
Last modification on : Wednesday, April 6, 2022 - 8:54:03 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 7:45:46 PM


Publisher files allowed on an open archive




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⟩



Record views


Files downloads