Silent MST Approximation for Tiny Memory

DOI10.1007/978-3-030-64348-5_10MaRDI QIDQ6487901zbMATH OpenFDO

Authors Lélia Blin, Swan Dubois, Laurent Feuilloley

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-64348-5_10

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Recommendations

• Memory requirements for silent stabilization
• Fast self-stabilizing minimum spanning tree construction. Using compact nearest common ancestor labeling scheme
• A Fast Distributed Approximation Algorithm for Minimum Spanning Trees

Cited in

(2)

• Memory requirements for silent stabilization
• Introduction to local certification

This page was built for publication: Silent MST Approximation for Tiny Memory

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