An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks

DOI10.7155/JGAA.00384MaRDI QIDQ2790154zbMATH OpenOpenAlexFDO

Authors Yuma Asada, Fukuhito Ooshita, Michiko Inoue

Publication date 3 March 2016

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00384

zbMATH Keywords

maximal matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• An efficient silent self-stabilizing algorithm for 1-maximal matching 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 in anonymous networks
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers
• Brief Announcement

Cited in

(11)

• Maximal matching stabilizes in quadratic time
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon without global identifiers
• An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
• Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
• A self-stabilizing algorithm for maximal matching in anonymous networks
• An efficient silent self-stabilizing 1-maximal matching algorithm under distributed daemon for arbitrary networks
• An efficient silent self-stabilizing algorithm for 1-maximal matching in anonymous networks
• Maximum matching for anonymous trees with constant space per process
• Brief Announcement
• Self-stabilization and Byzantine tolerance for maximal matching
• A self-stabilizing 1-maximal independent set algorithm

This page was built for publication: An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks

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