| Download | - View accepted manuscript: Linear-space algorithms for distance preserving embedding (PDF, 287 KiB)
|
|---|
| Author | Search for: Asano, T.; Search for: Bose, P.; Search for: Carmi, P.; Search for: Maheshwari, A.; Search for: Shu, Chang; Search for: Smid, M.; Search for: Wuhrer, Stefanie |
|---|
| Format | Text, Article |
|---|
| Conference | Canadian Conference on Computational Geometry, August 20-22, 2007, Ottawa, Ontario, Canada |
|---|
| Abstract | The distance preserving graph embedding problem is to embed vertices of a given weighted graph into points in 2-dimensional Euclidean space so that for each edge the distance between their corresponding endpoints is as close to the weight of the edge as possible. If the given graph is complete, that is, if distance constraints are given as a full matrix, then principal coordinate analysis can solve it in polynomial time. A serious disadvantage is its quadratic space requirement. In this paper we develop linear-space algorithms for this problem. A key idea is to partition a set of n objects into disjoint subsets (clusters) of size O(pn) such that the minimum inter cluster distance is maximized among all possible such partitions. |
|---|
| Publication date | 2007 |
|---|
| In | |
|---|
| Language | English |
|---|
| NRC number | NRCC 49830 |
|---|
| NPARC number | 8914111 |
|---|
| Export citation | Export as RIS |
|---|
| Report a correction | Report a correction (opens in a new tab) |
|---|
| Record identifier | 3bc87f0b-6635-4d88-a0f8-ae2e34ec8886 |
|---|
| Record created | 2009-04-22 |
|---|
| Record modified | 2020-08-12 |
|---|
