Checking Global Graph Properties by Means of Local Computations: the Majority Problem

DOI10.1016/S1571-0661(05)80197-5zbMath1114.68455OpenAlexW2089668714MaRDI QIDQ4222809

Eric Sopena, Igor Litovsky, Yves Métivier

Publication date: 13 December 1998

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0661(05)80197-5

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing with graph rewriting systems with priorities
• Coverings and minors: Application to local computations in graphs
• Locality in Distributed Graph Algorithms
• Different local controls for graph relabeling systems
• What can be computed locally?

This page was built for publication: Checking Global Graph Properties by Means of Local Computations: the Majority Problem