Computing Best and Worst Shortcuts of Graphs Embedded in Metric Spaces

Authors:
Jun Luo;Christian Wulff-Nilsen
Affiliations:
Department of Information and Computing Sciences, Universiteit Utrecht, Centrumgebouw Noord, Utrecht, The Netherlands 3584CH;Department of Computer Science, University of Copenhagen, Copenhagen O, Denmark DK-2100
Venue:
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Year:
2008

Citing 0
Cited 2

On the dilation spectrum of paths, cycles, and trees

Computational Geometry: Theory and Applications
Computing the dilation of edge-augmented graphs in metric spaces

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this talk I will present a new direction of algorithms whichdo not use any extra working array. More formally, we want todesign efficient algorithms which require no extra array of sizedepending on input size n but use only constant ...