Please use this identifier to cite or link to this item: http://buratest.brunel.ac.uk/handle/2438/1676
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLuczak, M J-
dc.contributor.authorNoble, S D-
dc.coverage.spatial11en
dc.date.accessioned2008-02-20T12:06:17Z-
dc.date.available2008-02-20T12:06:17Z-
dc.date.issued2002-
dc.identifier.citationDiscrete Applied Mathematics, 121(1-3): 307-315, Sep 2002en
dc.identifier.issn0166-218X-
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/1676-
dc.description.abstractWe define the decision problem {\textsc {data arrangement}}, which involves arranging the vertices of a graph $G$ at the leaves of a $d$-ary tree so that a weighted sum of the distances between pairs of vertices measured with respect to the tree topology is at most a given value. We show that {\textsc{data arrangement}} is strongly NP-complete for any fixed $d \ge 2$ and explain the connection between {\textsc{data arrangement}} and arranging data in a particular form of distributed directory.en
dc.format.extent157556 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherElsevieren
dc.subjectComplexityen
dc.subjectGraph embeddingen
dc.subjectData arrangementen
dc.titleOptimal arrangement of data in a tree directoryen
dc.typePreprinten
dc.identifier.doihttp://dx.doi.org/10.1016/S0166-218X(01)00174-3-
Appears in Collections:Computer Science
Mathematical Sciences

Files in This Item:
File Description SizeFormat 
revsubitted.pdf153.86 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.