The minimum linear arrangement problem on proper interval graphs
classification
💻 cs.DM
cs.DS
keywords
graphsintervallineararrangementminimumproblemproperalgorithm
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.