Labelled (Hyper)Graphs, Negotiations and the Naming Problem

DOI10.1007/978-3-540-87405-8_5zbMath1175.68273OpenAlexW1550811793MaRDI QIDQ3540388

Antoni Mazurkiewicz, Jérémie Chalopin, Yves Métivier

Publication date: 20 November 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-87405-8_5

Mathematics Subject Classification ID

Hypergraphs (05C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Grammars and rewriting systems (68Q42)

Related Items (4)

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

Cites Work

• Distributed enumeration
• A complete complexity classification of the role assignment problem
• Characterizations of classes of graphs recognizable by local computations
• Graph Labelings Derived from Models in Distributed Computing
• Stably computable predicates are semilinear
• Graph Transformations
• Foundations of Software Science and Computation Structures
• Computation in networks of passively mobile finite-state sensors
• Fibrations of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Labelled (Hyper)Graphs, Negotiations and the Naming Problem