Self-stabilizing labeling and ranking in ordered trees

DOI10.1016/J.TCS.2013.08.007MaRDI QIDQ391998zbMATHOpenAlexFDO

Authors Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore, Yvan Rivierre

Publication date 13 January 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.08.007

zbMATH Keywords

rankingself-stabilizationguide pairtree labelingtree networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Self-stabilizing Space Optimal Synchronization Algorithms on Trees
• SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
• On Self-stabilizing Search Trees
• Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks
• A self-stabilizing algorithm for the st-order problem

Cites work

• scientific article; zbMATH DE number 2036577 (Why is no real title available?)
• Introduction to Distributed Algorithms
• Memory requirements for silent stabilization
• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Self-stabilizing tree ranking
• Snap-Stabilizing Optimal Binary Search Tree

Cited in

(2)

• Linearization: locally self-stabilizing sorting in graphs
• On Self-stabilizing Search Trees

This page was built for publication: Self-stabilizing labeling and ranking in ordered trees

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