Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/1676
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Luczak, M J | - |
dc.contributor.author | Noble, S D | - |
dc.coverage.spatial | 11 | en |
dc.date.accessioned | 2008-02-20T12:06:17Z | - |
dc.date.available | 2008-02-20T12:06:17Z | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | Discrete Applied Mathematics, 121(1-3): 307-315, Sep 2002 | en |
dc.identifier.issn | 0166-218X | - |
dc.identifier.uri | http://bura.brunel.ac.uk/handle/2438/1676 | - |
dc.description.abstract | We 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.extent | 157556 bytes | - |
dc.format.mimetype | application/pdf | - |
dc.language.iso | en | - |
dc.publisher | Elsevier | en |
dc.subject | Complexity | en |
dc.subject | Graph embedding | en |
dc.subject | Data arrangement | en |
dc.title | Optimal arrangement of data in a tree directory | en |
dc.type | Preprint | en |
dc.identifier.doi | http://dx.doi.org/10.1016/S0166-218X(01)00174-3 | - |
Appears in Collections: | Computer Science Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
revsubitted.pdf | 153.86 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.