Brief Announcement

DOI10.1145/3087801.3087840MaRDI QIDQ5368993zbMATH OpenOpenAlexFDO

Authors Michiko Inoue, Fukuhito Ooshita, Sébastien Tixeuil

Publication date 11 October 2017

Published in Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3087801.3087840

zbMATH Keywords

self-stabilization1-maximal matchingdistributed unfair daemonarbitrary network

Mathematics Subject Classification ID

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

Recommendations

• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks
• A self-stabilizing algorithm for maximal matching in anonymous networks
• A self-stabilizing algorithm for maximal matching
• An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
• scientific article; zbMATH DE number 1735731
• An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks
• A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem

Cited in

(10)

• Dynamic and self-stabilizing distributed matching
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers
• Brief announcement: Fully lattice linear algorithms
• A self-stabilizing algorithm for a maximal 2-packing in a cactus graph under any scheduler
• scientific article; zbMATH DE number 1863300 (Why is no real title available?)
• An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks
• A self-stabilizing algorithm for maximal matching
• An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
• The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs

This page was built for publication: Brief Announcement

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