#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2006

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Dominique Buset, Mourad El Amiri, Grahame Erskine, Mirka Miller, Hebert Pérez-Rosés
- Discrete Mathematics
- 2016

The degree-diameter problem seeks to find the maximum possible order of a graph with a given (maximum) degree and diameter. It is known that graphs attaining the maximum possible value (the Moore… (More)

- Hebert Pérez-Rosés, Francesc Sebé, Josep Maria Ribó
- Computer Communications
- 2016

Some social networks, such as LinkedIn and ResearchGate, allow user endorsements for specific skills. In this way, for each skill we get a directed graph where the nodes correspond to users’ profiles… (More)

- Anthony Dekker, Hebert Pérez-Rosés, Guillermo Pineda-Villavicencio, Paul A. Watters
- J. Math. Model. Algorithms
- 2012

We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host graph), subject to constraints on the maximum degree and the diameter. We discuss some applications… (More)

Graph labellings have been a very fruitful area of research in the last four decades. However, despite the staggering number of papers published in the field (over 1000), few general results are… (More)

- Hebert Pérez-Rosés, Francesc Sebé
- J. Simulation
- 2015

In many simulation studies involving networks there is the need to rely on a sample network to perform the simulation experiments. In many cases, real network data is not available due to privacy… (More)

Augmented Reality systems have recently become widely used. This is due to the new open source libraries that have emerged for fast application development. In this paper we address one of the most… (More)

Given a tesselation of the plane, defined by a planar straightline graph G, we want to find a minimal set S of points in the plane, such that the Voronoi diagram associated with S ‘fits’ G. This is… (More)

- Premysl Holub, Mirka Miller, Hebert Pérez-Rosés, Joseph F. Ryan
- Discrete Applied Mathematics
- 2014

The degree diameter problem involves finding the largest graph (in terms of the number of vertices) subject to constraints on the degree and the diameter of the graph. Beyond the degree constraint… (More)

- Guillermo Pineda-Villavicencio, José Gómez, Mirka Miller, Hebert Pérez-Rosés
- Networks
- 2009

In the pursuit of obtaining largest graphs of given maximum degree ∆ and diameter D, many construction techniques have been developed. Compounding of graphs is one such technique. In this paper, by… (More)