#### Filter Results:

- Full text PDF available (1)

#### Publication Year

2011

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sergio Luis Pérez-Pérez, Luis Eduardo Urbán Rivero, Rafael López-Bracho, Francisco Javier Zaragoza Martínez
- 2014 11th International Conference on Electrical…
- 2014

The traveling repairman problem is a scheduling problem in which a repairman is supposed to visit some customers at their locations to perform some jobs. Each customer has a time window during which the repairman is allowed to arrive to perform the jobs. The goal is to maximize the number of visited locations. In this work we deal with a special case in… (More)

- S. L. Perez-Perez, G. B. Morales-Luna, F. D. Sagols-Troncoso
- 2011 8th International Conference on Electrical…
- 2011

The word problem and indeed the enu- meration problem in Coxeter groups are intractable in most cases. A direct way to solve the enumeration problem is by listing the canonical representatives of the equivalence classes, but this entails to solve the word problem for certain pairs of words in the group. We describe two methods to solve these problems and we… (More)

- Sergio Luis Pérez-Pérez, Gloria Aguilar Cruz, Celene Dorali Alfaro Quintero, Jorge Arturo Pérez Arcos, Francisco Javier Zaragoza Martínez
- 2014 11th International Conference on Electrical…
- 2014

A graph is said to be planar if it can be drawn on the plane with vertices as different points and edges as continuous curves that only intersect its vertices. An embedding of a graph is said to be primitive if its edges are primitive segments. A recent conjecture is that all planar graphs with n vertices have a primitive embedding in a square grid of side… (More)

- Sergio Luis Pérez-Pérez, Guillermo Morales-Luna, Feliu Sagols
- Computación y Sistemas
- 2012

Random selection of spanning trees on graphs has been treated extensively in technical literature. Popular randomized algorithms have time complexity varying from to , where is the order of a graph, namely, the number of vertices. In this work, we introduce effective and efficient procedures to select spanning trees using random walks with the purpose to… (More)

- ‹
- 1
- ›