Linearization: locally self-stabilizing sorting in graphs

DOI10.1137/1.9781611972870.10MaRDI QIDQ5233496zbMATH OpenOpenAlexFDO

Authors Melih Onus, Andrea Richa, Christian Scheideler

Publication date 11 September 2019

Published in 2007 Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972870.10

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• A note on the parallel runtime of self-stabilizing graph linearization
• SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS
• Optimal Distributed Algorithms for Sorting and Ranking
• Time complexity of distributed topological self-stabilization: the case of graph linearization
• Self-stabilizing labeling and ranking in ordered trees

Cited in

(10)

• Towards a universal approach for the finite departure problem in overlay networks
• A self-stabilizing hashed Patricia trie
• A note on the parallel runtime of self-stabilizing graph linearization
• A deterministic worst-case message complexity optimal solution for resource discovery
• Building self-stabilizing overlay networks with the transitive closure framework
• Corona: a stabilizing deterministic message-passing skip list
• Tiara: a self-stabilizing deterministic skip list and skip graph
• Re-Chord: a self-stabilizing chord overlay network
• Self-stabilizing metric graphs
• Extending Lattice Linearity for Self-stabilizing Algorithms

This page was built for publication: Linearization: locally self-stabilizing sorting in graphs

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