The minimum linear arrangement problem on proper interval graphs

2006/08/02 by Ilya Safro, Safro, Ilya
Computer Science · Engineering · #Advanced Graph Theory Research #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Formal Methods in Verification #VLSI and FPGA Design Techniques #cs.DM #cs.DS

paper · pdf · doi:10.48550/arxiv.cs/0608008

arxiv created 2006/08/02 · openalex publication_date 2006/08/02 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs

Related

• The planar minimum linear arrangement problem is different from the minimum linear arrangement problem
• A recognition algorithm for adjusted interval digraphs
• Maximum Linear Arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
• Extending Partial Representations of Proper and Unit Interval Graphs
• The Linear Arrangement Problem Parameterized Above Guaranteed Value