The minimum linear arrangement problem on proper interval graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Discrete Mathematics, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/114810

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0608008
 http://arxiv.org/abs/cs/0608008

Collections

arXiv