A New Proof of the GHS Minimum Spanning Tree Algorithm

DOI10.1007/11864219_9MaRDI QIDQ3524300zbMATH OpenOpenAlexFDO

Authors Yoram Moses, Benny Shimony

Publication date 9 September 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11864219_9

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Distributed algorithms (68W15) Network protocols (68M12)

Recommendations

• The verified incremental design of a distributed spanning tree algorithm: Extended abstract
• A highly asynchronous minimum spanning tree protocol
• scientific article; zbMATH DE number 2088672
• An algebraic framework for minimum spanning tree problems
• GHS algorithm on a graph with random weights

Cited in

(3)

• scientific article; zbMATH DE number 2088672 (Why is no real title available?)
• An algebraic framework for minimum spanning tree problems
• GHS algorithm on a graph with random weights

This page was built for publication: A New Proof of the GHS Minimum Spanning Tree Algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524300)