Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
OPODIS
/
Paper
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree.
Llia Blin
,
Franck Butelle
Venue
B
OPODIS
Year
2001
Proceedings
OPODIS
DBLP record
conf/opodis/BlinB01 ↗
Browse the full
OPODIS paper archive
.