Related references
Note: Only part of the references are listed.Simple decentralized graph coloring
Severino F. Galan
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2017)
Fast, Responsive Decentralized Graph Coloring
Alessandro Checco et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2017)
A 4n-move self-stabilizing algorithm for the minimal dominating set problem using an unfair distributed daemon
Well Y. Chiu et al.
INFORMATION PROCESSING LETTERS (2014)
Decentralized Constraint Satisfaction
Ken R. Duffy et al.
IEEE-ACM TRANSACTIONS ON NETWORKING (2013)
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
Nabil Guellati et al.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2010)
SELF-STABILIZING VERTEX COVER IN ANONYMOUS NETWORKS WITH OPTIMAL APPROXIMATION RATIO
Volker Turau
PARALLEL PROCESSING LETTERS (2010)
Complexity analysis of a decentralised graph colouring algorithm
K. R. Duffy et al.
INFORMATION PROCESSING LETTERS (2008)
SELF-STABILIZING GRAPH PROTOCOLS
Wayne Goddard et al.
PARALLEL PROCESSING LETTERS (2008)
Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
Volker Turau
INFORMATION PROCESSING LETTERS (2007)
Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
SM Hedetniemi et al.
COMPUTERS & MATHEMATICS WITH APPLICATIONS (2003)