Springer Verlag;Berlin, Heidelberg: Springer Berlin Heidelberg
摘要:
摘要： Self-stabilization is a fault-tolerant mechanism that enables a distributed system to recover from transient faults. In this paper, we consider the coloring problem and propose the first self-stabilizing algorithm under the distributed daemon model to 6-color planar graphs. The algorithm is randomized, anonymous and uniform. Starting from any initial configuration, it finds a proper coloring inO(n) rounds for an n-node graph. 出版者： Berlin, Heidelberg: Springer Berlin Heidelberg 出版日期： 2013 出處： Advances in Intelligent Systems and Applications - Volume 1, 2013, p.41-48 版權： Springer-Verlag Berlin Heidelberg 2013 識別號： ISSN: 2190-3018 識別號： ISBN: 9783642354519 識別號： ISBN: 3642354513 識別號： EISSN: 2190-3026 識別號： EISBN: 9783642354526 識別號： EISBN: 3642354521 識別號： DOI: 10.1007/978-3-642-35452-6_6
