Labelled (Hyper)Graphs, Negotiations and the Naming Problem
DOI10.1007/978-3-540-87405-8_5zbMATH Open1175.68273OpenAlexW1550811793MaRDI QIDQ3540388FDOQ3540388
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
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
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)
Cites Work
- Stably computable predicates are semilinear
- Distributed enumeration
- Local computations in graphs: the case of cellular edge local computations
- Graph Transformations
- A complete complexity classification of the role assignment problem
- Fibrations of graphs
- Characterizations of classes of graphs recognizable by local computations
- Title not available (Why is that?)
- Computation in networks of passively mobile finite-state sensors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph Labelings Derived from Models in Distributed Computing
- Foundations of Software Science and Computation Structures
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
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)
