Foundations of Software Science and Computation Structures

DOI10.1007/B95995zbMath1126.68496OpenAlexW3105029025MaRDI QIDQ5308444

Jérémie Chalopin, Yves Métivier

Publication date: 28 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95995

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Labelled (Hyper)Graphs, Negotiations and the Naming Problem ⋮ On the power of synchronization between two adjacent processes ⋮ How much memory is needed for leader election ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Topology recognition and leader election in colored networks ⋮ Graph labelings derived from models in distributed computing: A complete complexity classification

This page was built for publication: Foundations of Software Science and Computation Structures