Buscar
Mostrando ítems 1-3 de 3
Artículo
Continuous mean distance of a weighted graph
(Cornell University, 2021)
We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance can be de ned as the arithmetic mean of the distances between all pairs of vertices. This ...
Artículo
Shortcut sets for plane Euclidean networks (Extended abstract)
(Elsevier, 2016)
We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of segments, called shortcut set, while reducing the diameter of the locus of the resulting network. ...
Artículo
Shortcut sets for the locus of plane Euclidean networks
(Elsevier, 2018)
We study the problem of augmenting the locus N of a plane Euclidean network N by in- serting iteratively a finite set of segments, called shortcut set , while reducing the diameterof the locus of the resulting network. ...