Graph Labelings Derived from Models in Distributed Computing
DOI10.1007/11917496_27zbMATH Open1167.68399OpenAlexW1480521342MaRDI QIDQ3522967FDOQ3522967
Authors: J. 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
Recommendations
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Distributed graph traversals by relabelling systems with applications
- Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
- Algorithms for some graph problems on a distributed computational model
- On a generalized model of labeled graphs
- Visualization of distributed algorithms based on graph relabelling systems
- On graph labeling parameters
- scientific article; zbMATH DE number 4070955
- Graph partitioning models for parallel computing
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (12)
- Computing role assignments of proper interval graphs in polynomial time
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Title not available (Why is that?)
- Graph Transformations
- Computing role assignments of proper interval graphs in polynomial time
- Distributed Data Structures: A Survey on Informative Labeling Schemes
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Locally constrained graph homomorphisms -- structure, complexity, and applications
- Mobile Agents Implementing Local Computations in Graphs
- SOFSEM 2005: Theory and Practice of Computer Science
- Graph distance‐dependent labeling related to code assignment in computer networks
- On the power of synchronization between two adjacent processes
This page was built for publication: Graph Labelings Derived from Models in Distributed Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522967)
