Search
Now showing items 111-116 of 116
Article
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. ...
Article
Hamiltonian triangular refinements and space-filling curves
(Elsevier, 2019)
We have introduced here the concept of Hamiltonian triangular refinement. For any Hamiltonian triangulation it is shown that there is a refinement which is also a Hamiltonian triangulation and the corresponding Hamiltonian ...
Article
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 ...
Presentation
Breaking symmetries of graphs with resolving sets
(2014)
We undertake a study on the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. Our results include lower and upper bounds on that maximum, and ...
Presentation
Shortcut sets for Euclidean graphs
(2015-07)
A Euclidean graph G is the locus of a rectilinear embedding of a planar graph in the Euclidean plane. A shortcut set S is a collection of segments with end points on G such that the Euclidean graph obtained from G byadding ...
Article
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 ...