Distributed enumeration
From MaRDI portal
Publication:287005
DOI10.1016/S0020-0190(97)00022-7zbMath1336.68079OpenAlexW2911256705MaRDI QIDQ287005
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00022-7
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Locally computable enumerations, Leader election in plane cellular automata, only with left-right global convention, Election in partially anonymous networks with arbitrary knowledge in message passing systems, Drawing maps with advice, Locality and checkability in wait-free computing, Labelled (Hyper)Graphs, Negotiations and the Naming Problem, On the power of synchronization between two adjacent processes, Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds, Visualization of Distributed Algorithms Based on Graph Relabelling Systems1 1This work has been supported by the European TMR research network GETGRATS, and by the “Conseil Régional d' Aquitane”., Graph Relabelling Systems, Snap-stabilizing tasks in anonymous networks, Locality and Checkability in Wait-Free Computing, Graph labelings derived from models in distributed computing: A complete complexity classification, A self-stabilizing enumeration algorithm.
Cites Work
