Show simple item record

dc.contributor.authorDíaz Cort, Josep
dc.contributor.authorPetit Silvestre, Jordi
dc.contributor.authorSerna Iglesias, María José
dc.contributor.authorTrevisan, Marco
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.identifier.citationDiaz, J., Petit, J., Serna, M., Trevisan, M. "Approximating layout problems on random sparse graphs". 1998.
dc.description.abstractWe show that, with high probability, several layout problems are approximable within a constant for random graphs drawn from the standard Gnp model with p=c/n for some constant c. Our results establish that, in fact, any algorithm that returns a feasible solution will produce such an approximation for graphs with good expansion properties.
dc.format.extent10 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherRandom sparse graphs
dc.subject.otherLinear arrangement
dc.titleApproximating layout problems on random sparse graphs
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorDiaz, J.; Petit, J.; Serna, M.; Trevisan, M.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder