Open AccessA Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
Author(s) -
Lélia Blin,
Franck Butelle
Publication year - 2001
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - minimum spanning tree , computer science , distributed minimum spanning tree , asynchronous communication , spanning tree , distributed algorithm , prim's algorithm , time complexity , minimum weight , algorithm , reverse delete algorithm , graph algorithms , kruskal's algorithm , graph , theoretical computer science , mathematics , discrete mathematics , distributed computing , combinatorics , computer network
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom