Labelled (Hyper)Graphs, Negotiations and the Naming Problem

DOI10.1007/978-3-540-87405-8_5MaRDI QIDQ3540388zbMATH OpenOpenAlexFDO

Authors J. Chalopin, Antoni Mazurkiewicz, 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) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Grammars and rewriting systems (68Q42) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On a labeling problem in graphs
• Graph labelings, embedding and NP-completeness theorems
• Graph labelings and complexity problems: a review
• A note on labeling of graphs
• Graph Labelings: A Prime Area to Explore
• A note on labelings of graphs
• scientific article; zbMATH DE number 4070955
• scientific article; zbMATH DE number 969104
• The $L(2,1)$-Labeling Problem on Graphs
• A result on graph labelling

Cites work

• scientific article; zbMATH DE number 1236360 (Why is no real title available?)
• scientific article; zbMATH DE number 2006642 (Why is no real title available?)
• scientific article; zbMATH DE number 3005477 (Why is no real title available?)
• scientific article; zbMATH DE number 2182498 (Why is no real title available?)
• scientific article; zbMATH DE number 2104616 (Why is no real title available?)
• A complete complexity classification of the role assignment problem
• Characterizations of classes of graphs recognizable by local computations
• Computation in networks of passively mobile finite-state sensors
• Distributed enumeration
• Fibrations of graphs
• Foundations of Software Science and Computation Structures
• Graph Labelings Derived from Models in Distributed Computing
• Graph Transformations
• Local computations in graphs: the case of cellular edge local computations
• Stably computable predicates are semilinear

Cited in

(3)

• How much memory is needed for leader election
• Topology recognition and leader election in colored networks
• Leader election for anonymous asynchronous agents in arbitrary networks

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540388)