other · OpenGrey (Institut de l'Information Scientifique et Technique) · 1989
Yet another distributed election and (minimum-weight) spanning tree algorithm
Lavallee, Yvan, Lavault, Christian, Institut National de Recherche en Informatique et en Automatique (INRIA), 78 - Le Chesnay (France). Unite de Recherche de Rocquencourt
Cited by 0Abstract and details only
Abstract
The index has no abstract for this paper.
Cite this paper
Lavallee, Y., Lavault, C., & Institut National de Recherche en Informatique et en Automatique (INRIA), L. C. F. U. D. R. D. R. (1989). Yet another distributed election and (minimum-weight) spanning tree algorithm. OpenGrey (Institut de l'Information Scientifique et Technique).
Lavallee, Yvan, et al. “Yet another distributed election and (minimum-weight) spanning tree algorithm.” OpenGrey (Institut de l'Information Scientifique et Technique), 1989.
Lavallee, Yvan, Christian Lavault, and 78 - Le Chesnay (France). Unite de Recherche de Rocquencourt Institut National de Recherche en Informatique et en Automatique (INRIA). 1989. “Yet another distributed election and (minimum-weight) spanning tree algorithm.” OpenGrey (Institut de l'Information Scientifique et Technique).
Lavallee, Y., Lavault, C. and Institut National de Recherche en Informatique et en Automatique (INRIA), L.C.F.U.D.R.D.R. (1989) ‘Yet another distributed election and (minimum-weight) spanning tree algorithm’, OpenGrey (Institut de l'Information Scientifique et Technique).
@misc{lavallee1989another,
title = {{Yet another distributed election and (minimum-weight) spanning tree algorithm}},
author = {Lavallee, Yvan and Lavault, Christian and Institut National de Recherche en Informatique et en Automatique (INRIA), 78 - Le Chesnay (France). Unite de Recherche de Rocquencourt},
journal = {OpenGrey (Institut de l'Information Scientifique et Technique)},
year = {1989}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.