#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1986

2013

- This year (0)
- Last 5 years (5)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

#### Organism

Learn More

- Ivan Lavallée, Gérard Roucairol
- Inf. Process. Lett.
- 1986

In this paper, we consider a connected undirected graph with n nodes. An asynchronous dist r ibuted algori thm is described which determines a spanning tree of the graph. Moreover, if the edges of the graph are weighted, the same algorithm can compute a minimum-weighted spanning tree. This algori thm can be favourably compared to the one of Gallagher et al.… (More)

- Thuy Lien Pham, Marc Bui, Ivan Lavallée, Si Hoàng Do
- IICS
- 2005

- Thuy Lien Pham, Ivan Lavallée, Marc Bui, Si Hoàng Do
- The 4th International Symposium on Parallel and…
- 2005

This paper presents an asynchronous distributed algorithm for solving the maximum flow problem which is based on the preflow-push approach of Golberg-Tarjan. Each node in graph initially knows the capacities of outgoing and incoming adjacent arcs, the source nodes knows additionally the number of nodes in graph. Nodes execute the same algorithm, and… (More)

- Ivan Lavallée, Christian Lavault
- WDAG
- 1990

Ivan LAVALL EE Christian LAVAULT INRIA, Domaine de Voluceau, Rocquencourt, B.P. 105, 78153 Le Chesnay Cedex. France. E mail : lavault@seti.inria.fr Abstract Two types of distributed fully asynchronous probabilistic algorithms are given in the present paper which elect a leader and nd a spanning tree in arbitrary anonymous networks of processes. Our… (More)

- Gérard Florin, Roberto Gómez, Ivan Lavallée
- ISADS
- 1993

- Thuy Lien Pham, Marc Bui, Ivan Lavallée, Si Hoàng Do
- RIVF
- 2006

- Said Fouchal, Murat Ahat, Ivan Lavallée
- ISCC
- 2011

Résumé—We propose in this paper a novel clustering algorithm in ultrametric spaces. It has a computational cost of O(n). This method is based on the ultratriangle inequality property. Using the order of ultrametric space we demonstrate that we can deduce the proximities between all data in this space with just a few informations. We present an example of… (More)

- Said Fouchal, Ivan Lavallée
- Q2SWinet
- 2011

We introduce in this paper a competitive unsupervised clustering algorithm which has two strong features: it is fast and flexible on the processed data type as well as in terms of precision. Our approach has a computational cost, in the worst case, of O(n^2)+ ε, and in the average case, of O(n)+ ε. This complexity is due to the use of ultrametric… (More)

- Soufian Ben Amor, V. Levorato, Ivan Lavallée
- RIVF
- 2007

We propose in this paper a generalization of percolation processes in Z using the pretopology theory. We formalize the notion of neighborhood by extending it to the concept of proximity, expressing different types of connections that may exist between the elements of a population. A modeling and simulation of forest fire using this approach shows the… (More)

A complex system is generally regarded as being a network of elements in mutual interactions, which total behavior cannot be deduced from that of its parts and their properties. Thus, the study of a complex phenomenon requires a holistic approach considering the system in its totality. The aim of our approach is the design of a unifying theoretical… (More)