The minimum linear arrangement problem on proper interval graphs
离散数学
2007-05-23 v1 数据结构与算法
摘要
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
引用
@article{arxiv.cs/0608008,
title = {The minimum linear arrangement problem on proper interval graphs},
author = {Ilya Safro},
journal= {arXiv preprint arXiv:cs/0608008},
year = {2007}
}