Dynamic and self-stabilizing distributed matching
DOI10.1145/571825.571877zbMath1292.68011MaRDI QIDQ5170890
Lisa Higham, Karen Seyffarth, Subhendu Chattopadhyay
Publication date: 25 July 2014
Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/571825.571877
05C90: Applications of graph theory
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W15: Distributed algorithms
Related Items