MathematicsComputer Science

The geometry of graphs and some of its algorithmic applications

N. Linial, E. London, Yuri Rabinovich

1994.11.20COMBINATORICA

DOI: 10.1109/sfcs.1994.365733

tlooto Summary

Efficient algorithms for embedding graphs low-dimensionally with a small distortion, and a new deterministic polynomial-time algorithm that finds a (nearly tight) cut meeting this bound.

Abstract

Abstract is not available.

Citation format

LINIAL, N.; LONDON, E.; RABINOVICH, Yuri. The geometry of graphs and some of its algorithmic applications. COMBINATORICA, 1994, 15: 215–245.