Local computations in graphs: the case of cellular edge local computations
From MaRDI portal
Recommendations
Cited in
(29)- Localization of edges in graph models of two-level algorithms
- Characterizations of classes of graphs recognizable by local computations
- Computational complexity of covering disconnected multigraphs
- Semi-local model of computations on graphs to break the local symmetry (work in progress)
- Computing role assignments of split graphs
- Computing role assignments of proper interval graphs in polynomial time
- Local computations on triangular graphs
- Graph labelings derived from models in distributed computing: A complete complexity classification
- Characterizing topological assumptions of distributed algorithms in dynamic networks
- Comparing Universal Covers in Polynomial Time
- Labelled (Hyper)Graphs, Negotiations and the Naming Problem
- Checking Global Graph Properties by Means of Local Computations: the Majority Problem
- scientific article; zbMATH DE number 1504828 (Why is no real title available?)
- Computing role assignments of proper interval graphs in polynomial time
- Graph Transformations
- Foundations of Software Science and Computation Structures
- Experimental and Efficient Algorithms
- SOFSEM 2005: Theory and Practice of Computer Science
- An algorithmic framework for locally constrained homomorphisms
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- An algorithmic framework for locally constrained homomorphisms
- On the power of synchronization between two adjacent processes
- Computational complexity of covering disconnected multigraphs
- Computational complexity of covering coloured mixed multigraphs with simple degree partitions
- Computing a 3-role assignment is polynomial-time solvable on complementary prisms
- Computational complexity of covering multigraphs with semi-edges: small cases
- Computing role assignments of chordal graphs
- Computational complexity of covering regular trees
- Comparing universal covers in polynomial time
This page was built for publication: Local computations in graphs: the case of cellular edge local computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3416074)
