Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

EOR
2006

favoriteEmaildiscussreport

110views more EOR 2006»

A constructive algorithm for realizing a distance matrix

13 years 4 months ago

A constructive algorithm for realizing a distance matrix

Download doc.rero.ch

The natural metric of a weighted graph is the length of the shortest paths between all pairs of vertices. The investigated problem consists in a representation of a given metric by a graph, such that the total length of the graph is minimized. For that purpose, we give a constructive algorithm based on a technique of reduction, fusion and deletion. We then show some results on a set of various distance matrices whose optimal realization is known. Key words: metrics, reduction, heuristics 1991 MSC: 68R05, 05C10, 05C12, 05C50, 05C62

Sacha C. Varone

Real-time Traffic

EOR 2006 | Investigated Problem | Shortest Paths | Weighted Graph |

claim paper

Related Content

» Uniqueness of LowRank Matrix Completion by Rigidity Theory

» Reconstructing an Ultrametric Galled Phylogenetic Network from a Distance Matrix

» Relay Placement and Movement Control for Realization of FaultTolerant Ad Hoc Networks

» Lossless scalar functions Boundary interpolation Schur algorithm and Obers canonical form

» Adaptive Genetic Algorithm with Mutation and Crossover Matrices

» Sensor Network Localization Using Sensor Perturbation

» Constructing a Dictionary of Human Brain Folding Patterns

» Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

» Learning a kernel matrix for nonlinear dimensionality reduction

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	EOR
Authors	Sacha C. Varone

Comments (0)