Incremental distributed asynchronous algorithm for minimum spanning trees

DOI10.1016/0169-7552(93)90089-MMaRDI QIDQ4280709zbMATH OpenFDO

Authors Yung H. Tsin

Publication date 24 February 1994

Published in Computer Networks and ISDN Systems (Search for Journal in Brave)

zbMATH Keywords

minimum spanning treecommunication networksdistributed algorithmincremental algorithmsvertex insertion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Mathematical problems of computer architecture (68M07)

Recommendations

• scientific article; zbMATH DE number 3956442
• An efficient parallel algorithm for updating minimum spanning trees
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
• Improving the Time Complexity of Message-Optimal Distributed Algorithms for Minimum-Weight Spanning Trees

Cited in

(2)

• Inclusion of isolated nodes into the minimum spanning tree of an ad-hoc wireless sensor network
• A highly asynchronous minimum spanning tree protocol

This page was built for publication: Incremental distributed asynchronous algorithm for minimum spanning trees

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