Brief Announcement
From MaRDI portal
Publication:5368993
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)