• On the relation between graph distance and Euclidean distance in random geometric graphs 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Perarnau Llobet, Guillem; Pérez Giménez, Xavier (2016-09-01)
      Article
      Accés obert
      Given any two vertices u, v of a random geometric graph G(n, r), denote by dE(u, v) their Euclidean distance and by dE(u, v) their graph distance. The problem of finding upper bounds on dG(u, v) conditional on dE(u, v) ...