Characterizations of classes of graphs recognizable by local computations
From MaRDI portal
Publication:1879372
DOI10.1007/s00224-003-1062-1zbMath1069.68561MaRDI QIDQ1879372
Anca Muscholl, Yves Métivier, Emmanuel Godard
Publication date: 22 September 2004
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-003-1062-1
68R10: Graph theory (including graph drawing) in computer science
68Q42: Grammars and rewriting systems
05C85: Graph algorithms (graph-theoretic aspects)
68W15: Distributed algorithms
Related Items
On the power of synchronization between two adjacent processes, Sublinear fully distributed partition with applications, Labelled (Hyper)Graphs, Negotiations and the Naming Problem, Workshop on Graph Computation Models