An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks

DOI10.7155/JGAA.00384zbMath1331.05200OpenAlexW2294993062MaRDI QIDQ2790154

Fukuhito Ooshita, Michiko Inoue, Yuma Asada

Publication date: 3 March 2016

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

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

zbMATH Keywords

maximal matching

Mathematics Subject Classification ID

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

This page was built for publication: An Efficient Silent Self-Stabilizing 1-Maximal Matching Algorithm in Anonymous Networks