Pages that link to "Item:Q3522967"
From MaRDI portal
The following pages link to Graph Labelings Derived from Models in Distributed Computing (Q3522967):
Displaying 12 items.
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- On the power of synchronization between two adjacent processes (Q660989) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Graph labelings derived from models in distributed computing: A complete complexity classification (Q3100700) (← links)
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem (Q3540388) (← links)
- Mobile Agents Implementing Local Computations in Graphs (Q3540391) (← links)
- Graph distance‐dependent labeling related to code assignment in computer networks (Q4667824) (← links)
- (Q5261996) (← links)
- Graph Transformations (Q5292599) (← links)
- SOFSEM 2005: Theory and Practice of Computer Science (Q5711520) (← links)
- Distributed Data Structures: A Survey on Informative Labeling Schemes (Q5756710) (← links)