The minimum linear arrangement problem on proper interval graphs

Simple item page
dc.creatorSafro, Ilya
dc.date2006-08-02
dc.date.accessioned2026-07-07T07:19:56Z
dc.date.available2026-07-07T07:19:56Z
dc.descriptionWe 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
dc.identifierhttps://arxiv.org/abs/cs/0608008
dc.identifierhttp://arxiv.org/abs/cs/0608008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/114810
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.titleThe minimum linear arrangement problem on proper interval graphs
dc.typetext

Files

Collections

arXiv