Embeddings of Graphs in Euclidean Spaces.
J. Reiterman, V Rödl, E. Sinajová (1989)
Discrete & computational geometry
Similarity:
Displaying similar documents to “Approximating Euclidean Distances by Small Degree Graphs*”
Embeddings of Graphs in Euclidean Spaces.
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
Can Visibility Graphs Be Represented Compactly?.
N. Alon, S. Suri, P.K. Agarwal, B. Aronov (1994)
Discrete & computational geometry
Similarity:
Delaunay Graphs Are Almost as Good as Complete Graphs.
D.P. Dobkin, S.J. Friedman, K.J. Supowit (1990)
Discrete & computational geometry
Similarity:
Classes of Graphs Which Approximate the Complete Euclidean Graph.
J.M. Keil, C.A. Gutwin (1992)
Discrete & computational geometry
Similarity:
On the Contact Dimension of Graphs.
P. Frankl, H. Maehara (1988)
Discrete & computational geometry
Similarity:
Disjoint Edges in Geometric Graphs.
P. Erdös, N. Alon (1989)
Discrete & computational geometry
Similarity:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
H. Maehara (1991)
Discrete & computational geometry
Similarity:
On Sparse Spanners of Weighted Graphs.
G. Das, D. Dobkin, I. Althöfer, D. Joseph, J. Soares (1993)
Discrete & computational geometry
Similarity:
Generalized Delaunay Triangulation for Planar Graphs.
D.T. Lee, A.K. Lin (1986)
Discrete & computational geometry
Similarity:
Visibility Graphs of Staircase Polygons and the Weak Bruhat Order, I: from Visibility Graphs to Maximal Chains.
K. Kumar, J. Abello, O. Egecioglu (1995)
Discrete & computational geometry
Similarity: