"A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for ..."

Lélia Blin, Franck Butelle (2001)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2005-09-26

- no documents available
- export record
  dblp key:
  - conf/opodis/BlinB01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/opodis/BlinB01
Lélia Blin, Franck Butelle:
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree. OPODIS 2001: 113-124

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.