On geodetic sets formed by boundary vertices (2008)
José Cáceres, Carmen Hernando, Mercè Mora
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
Carmen Hern, Mercè Mora, Ignacio M. Pelayo, Carlos Seara, José Cáceres, Mari L. Puertas
the metric dimension of some families of graphs
Separability by two lines and by flat polygonals ∗ (2007)
Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara
In this paper we study the separability in the plane by two criteria: double wedge separability and constant turn separability. We give O(N log N)-time optimal algorithms for computing all the...
On the steiner, geodetic and hull numbers of graphs (2005)
Carmen Hernando, Tao Jiang, Mercè Mora
Given a graph G and a subset W ⊆ V (G), a Steiner W-tree is a tree of minimum order that contains all of W.LetS(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W)...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimumorder that contains all of W. Let S(W) denote the set of all vertices in G that lie onsome Steiner W-tree; we call S(W)...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G ifthere exists a vertex u such that no neighbor of v is further away from u than v.We obtain a number of properties...
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W)...
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Splitting a Delaunay Triangulation in Linear Time (2001)
Bernard Chazelle, Bernard Chazelle, Olivier Devillers, Olivier Devillers, Ferran Hurtado, Ferran Hurtado, ...
Computing the Delaunay triangulation of n points requires usually a minimum of# n log n# operations, but in some special cases where some additional knowledge is provided, faster algorithms can be...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Splitting a Delaunay Triangulation in Linear Time (2001)
Chazelle, Bernard, Devillers, Olivier, Hurtado, Ferran, Mora, Mercè, Sacristán, Vera, Teillaud, Monique
Computing the Delaunay triangulation of $n$ points requires usually a minimum of $\Omega(n\log n)$ operations, but in some special cases where some additional knowledge is provided, faster algorithms...
Geometric tree graphs of points in convex position (1997)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Márquez Pérez, Alberto, Mora, Mercè, Noy, Marc
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and...
Geometric tree graphs of points in convex position (1997)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Márquez Pérez, Alberto, Mora, Mercè, Noy, Marc
Given a set $P$ of points in the plane, the geometric tree graph of$P$ is defined as the graph $T(P)$ whose vertices are non-crossingrectilinear spanning trees of $P$, and where two trees $T_1$ and...
Geometric tree graphs of points in convex position (1997)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Márquez Pérez, Alberto, Mora, Mercè, Noy, Marc
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and...