The geometry of graphs and some of its algorithmic applications

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. >

[1]  Éva Tardos,et al.  Improved bounds on the max-flow min-cut ratio for multicommodity flows , 1993, Comb..

[2]  R. Motwani,et al.  Approximate graph coloring by semidefinite programming , 1994, FOCS 1994.

[3]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[4]  Nathan Linial.  Local-Global Phenomena in Graphs , 1993, Comb. Probab. Comput..

[5]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..

[6]  Michael E. Saks,et al.  Sphere packing and local majorities in graphs , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[7]  Mihalis Yannakakis,et al.  Approximate max-flow min-(multi)cut theorems and their applications , 1993, SIAM J. Comput..

[8]  L. Cowen.  On local representations of graphs and networks , 1993 .

[9]  David P. Dobkin,et al.  On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..

[10]  J. Arias-de-Reyna,et al.  Finite metric spaces needing high dimension for lipschitz embeddings in banach spaces , 1992 .

[11]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[12]  M. Laurent,et al.  Applications of cut polyhedra , 1992 .

[13]  Jiÿ ´ õ Matouÿ.  Note on bi-Lipschitz embeddings into normed spaces , 1992 .

[14]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[15]  J. Matousek.  Note on bi-Lipschitz embeddings into normed spaces , 1992 .

[16]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Bonnie Berger,et al.  The fourth moment method , 1991, SODA '91.

[18]  Alexander K. Kelmans,et al.  Graph planarity and related topics , 1991, Graph Structure Theory.

[19]  R. Ravi,et al.  Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[20]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[21]  Keith Ball.  Isometric Embedding in lp-spaces , 1990, Eur. J. Comb..

[22]  Gary L. Miller,et al.  Separators in two and three dimensions , 1990, STOC '90.

[23]  H. Maehara,et al.  Metric transforms and Euclidean embeddings , 1990 .

[24]  Vojtech Rödl,et al.  Geometrical embeddings of graphs , 1989, Discret. Math..

[25]  L. Lovász,et al.  Orthogonal representations and connectivity of graphs , 1989 .

[26]  Noga Alon,et al.  Cutting disjoint disks by straight lines , 1989, Discret. Comput. Geom..

[27]  G. Pisier.  The volume of convex bodies and Banach space geometry , 1989 .

[28]  Peter Frankl,et al.  On the contact dimensions of graphs , 1988, Discret. Comput. Geom..

[29]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[30]  László Lovász,et al.  Rubber bands, convex embeddings and graph connectivity , 1988, Comb..

[31]  Peter Frankl,et al.  The Johnson-Lindenstrauss lemma and the sphericity of some graphs , 1987, J. Comb. Theory, Ser. B.

[32]  J. Lindenstrauss,et al.  On lipschitz embedding of finite metric spaces in low dimensional normed spaces , 1987 .

[33]  Robert E. Tarjan,et al.  Rotation distance, triangulations, and hyperbolic geometry , 1986, STOC '86.

[34]  Hans S. Witsenhausen,et al.  Minimum dimension embedding of finite metric spaces , 1986, J. Comb. Theory, Ser. A.

[35]  J. Bourgain.  On lipschitz embedding of finite metric spaces in Hilbert space , 1985 .

[36]  R. Graham,et al.  On isometric embeddings of graphs , 1985 .

[37]  C. Godsil,et al.  Cycles in graphs , 1985 .

[38]  W. B. Johnson,et al.  Extensions of Lipschitz mappings into Hilbert space , 1984 .

[39]  Peter Winkler,et al.  Proof of the squashed cube conjecture , 1983, Comb..

[40]  László Lovász,et al.  On the Shannon capacity of a graph , 1979, IEEE Trans. Inf. Theory.

[41]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[42]  E. M. Andreev.  ON CONVEX POLYHEDRA IN LOBAČEVSKIĬ SPACES , 1970 .

[43]  E. M. Andreev.  ON CONVEX POLYHEDRA OF FINITE VOLUME IN LOBAČEVSKIĬ SPACE , 1970 .

[44]  B. Rothschild,et al.  MULTICOMMODITY NETWORK FLOWS. , 1969 .

[45]  B. Rothschild,et al.  Feasibility of Two Commodity Network Flows , 1966, Oper. Res..

[46]  T. C. Hu.  Multi-Commodity Network Flows , 1963 .

[47]  L. Danzer,et al.  Über zwei Probleme bezüglich konvexer Körper von P. Erdös und von V. L. Klee , 1962 .

[48]  Leonard M. Blumenthal,et al.  Theory and applications of distance geometry , 1954 .

[49]  Lewis Carroll,et al.  Alice Through the Looking-Glass and What Alice Found There , 1871 .