Buscar
Mostrando ítems 11-20 de 23
Artículo
Computing the Tutte polynomial of Archimedean tilings
(2014)
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method for computing the Tutte ...
Artículo
Resolving sets for Johnson and Kneser graphs
(2013)
A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, there exists x∈Sx∈S such that the distances d(u,x)≠d(v,x)d(u,x)≠d(v,x). In this paper, we consider the Johnson graphs J(n,k)J(n,k) ...
Artículo
Towards a new framework for domination
(2011)
Dominating concepts constitute a cornerstone in Graph Theory. Part of the efforts in the field have been focused in finding different mathematical frameworks where domination notions naturally arise, providing new points ...
Artículo
Reporting Bichromatic Segment Intersections from Point Sets
(2012)
In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets of segments. Given two sets R and B of n points in the plane defining two sets of segments, say red ...
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
Transforming Triangulations on Nonplanar Surfaces
(2010)
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some ...
Artículo
Separability of Point Sets by k-Level Linear Classification Trees
(2012)
Let R and B be sets of red and blue points in the plane in general position. We study the problem of computing a k-level binary space partition (BSP) tree to classify/separate R and B, such that the tree defines a linear ...
Artículo
Cover contact graphs
(2012)
We study problems that arise in the context of covering certain geometric objects called seeds (e.g., points or disks) by a set of other geometric objects called cover (e.g., a set of disks or homothetic triangles). We ...
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
Scutoids are a geometrical solution to three-dimensional packing of epithelia
(Nature Publishing Group, 2018)
As animals develop, tissue bending contributes to shape the organs into complex three-dimensional structures. However, the architecture and packing of curved epithelia remains largely unknown. Here we show by means of ...