Buscar
Mostrando ítems 21-23 de 23
Artículo
The difference between the metric dimension and the determining number of a graph
(2014)
We study the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. We develop a technique that uses functions related to locating-dominating sets to ...
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. ...
Artículo
Computing optimal shortcuts for networks
(ELSEVIER SCIENCE BV; ELSEVIER, 2019)
We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between any two points along the edges of the resulting network. Problems of this type have received ...