#### Filter Results:

#### Publication Year

2007

2011

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Victor Chepoi, Tristan Fevat, Emmanuel Godard, Yann Vaxès
- Algorithmica
- 2007

Given a graph G=(V,E), a vertex v of G is a median vertex if it minimizes the sum of the distances to all other vertices of G. The median problem consists of finding the set of all median vertices of G. In this note, we present self-stabilizing algorithms for the median problem in partial rectangular grids and relatives. Our algorithms are based on the fact… (More)

- Tristan Fevat, Emmanuel Godard
- 2011 IEEE International Parallel & Distributed…
- 2011

We consider the well known Coordinated Attack Problem, where two generals have to decide on a common attack, when their messengers can be captured by the enemy. Informally, this problem represents the difficulties to agree in the present of communication faults. We consider here only omission faults (loss of message), but contrary to previous studies, we do… (More)

Given a graph G = (V, E), a vertex v of G is a median vertex if it minimizes the sum of the distances to all other vertices of G. The median problem consists in finding the set of all median vertices of G. In this note, we present a self-stabilizing algorithm for the median problem in partial rectangular grids. Our algorithm is based on the fact that… (More)

- ‹
- 1
- ›