scispace - formally typeset
Search or ask a question

Showing papers by "Yuri Rabinovich published in 1994"


Proceedings ArticleDOI
20 Nov 1994
TL;DR: Some implications of viewing graphs as geometric objects are explored and efficient algorithms for embedding graphs low-dimensionally with a small distortion are developed.
Abstract: We explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graph-theoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that respect the metric of the (possibly weighted) graph. Given a graph G we map its vertices to a normed space in an attempt to (i) Keep down the dimension of the host space and (ii) Guarantee a small distortion, i.e., make sure that distances between vertices in G closely match the distances between their geometric images. We develop efficient algorithms for embedding graphs low-dimensionally with a small distortion. >

152 citations


Journal ArticleDOI
TL;DR: Fairly tight lower bounds are proved on the clique number of G as a function of p, q and the number of vertices in G.

9 citations