Optimal coteries for rings and related networks
DOI10.1007/BF02242737zbMATH Open1448.68116OpenAlexW3131990685MaRDI QIDQ5136994FDOQ5136994
Authors: Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda
Publication date: 30 November 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02242737
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10) Distributed systems (68M14)
Cites Work
Cited In (8)
- Byzantine quorum systems with maximum availability.
- A delay optimal coterie on the \(k\)-dimensional folded Petersen graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planar quorums
- Optimal coteries and voting schemes
- Minimum self-dual decompositions of positive dual-minor Boolean functions
- Transformations on regular nondominated coteries and their applications
This page was built for publication: Optimal coteries for rings and related networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136994)