4.5 Article

Eventually lattice-linear algorithms

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Operations Research & Management Science

Simple decentralized graph coloring

Severino F. Galan

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2017)

Article Computer Science, Hardware & Architecture

Fast, Responsive Decentralized Graph Coloring

Alessandro Checco et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2017)

Article Computer Science, Information Systems

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)

Article Computer Science, Hardware & Architecture

Decentralized Constraint Satisfaction

Ken R. Duffy et al.

IEEE-ACM TRANSACTIONS ON NETWORKING (2013)

Article Computer Science, Theory & Methods

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)

Article Computer Science, Interdisciplinary Applications

SELF-STABILIZING VERTEX COVER IN ANONYMOUS NETWORKS WITH OPTIMAL APPROXIMATION RATIO

Volker Turau

PARALLEL PROCESSING LETTERS (2010)

Article Computer Science, Information Systems

Complexity analysis of a decentralised graph colouring algorithm

K. R. Duffy et al.

INFORMATION PROCESSING LETTERS (2008)

Article Computer Science, Interdisciplinary Applications

SELF-STABILIZING GRAPH PROTOCOLS

Wayne Goddard et al.

PARALLEL PROCESSING LETTERS (2008)

Article Computer Science, Information Systems

Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler

Volker Turau

INFORMATION PROCESSING LETTERS (2007)

Article Mathematics, Applied

Self-stabilizing algorithms for minimal dominating sets and maximal independent sets

SM Hedetniemi et al.

COMPUTERS & MATHEMATICS WITH APPLICATIONS (2003)