The following pages link to On the contact dimensions of graphs (Q579284):
Displaying 9 items.
- Dispersed points and geometric embedding of complete bipartite graphs (Q807631) (← links)
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs (Q1121912) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Embeddings of graphs in Euclidean spaces (Q1812683) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
