Graph Labelings Derived from Models in Distributed Computing
From MaRDI portal
Publication:3522967
DOI10.1007/11917496_27zbMath1167.68399OpenAlexW1480521342MaRDI QIDQ3522967
Jérémie Chalopin, Daniël Paulusma
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_27
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Computing role assignments of proper interval graphs in polynomial time ⋮ Locally constrained graph homomorphisms -- structure, complexity, and applications ⋮ Labelled (Hyper)Graphs, Negotiations and the Naming Problem ⋮ Mobile Agents Implementing Local Computations in Graphs ⋮ On the power of synchronization between two adjacent processes ⋮ Computing Role Assignments of Proper Interval Graphs in Polynomial Time