A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
type: Item
instance of: scholarly article
title: A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
zbMATH Open document ID: 1233.68179
author: Nabil Guellati
author: H. Kheddouci
published in: Journal of Parallel and Distributed Computing
publication date: 2012-03-07T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6012835
zbMATH Keywords: distributed algorithm
zbMATH Keywords: self-stabilization
zbMATH Keywords: graph algorithm
zbMATH Keywords: independence
zbMATH Keywords: domination
zbMATH Keywords: coloring
zbMATH Keywords: matching
MaRDI profile type: Publication
full work available at URL: j.jpdc.2009.11.006
OpenAlex ID: W2034396486
cites work: Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
cites work: Q4457223
cites work: Dynamic and self-stabilizing distributed matching
cites work: Q5315023
cites work: Self-stabilizing systems in spite of distributed control
cites work: Self-stabilization
cites work: Q4259989
cites work: Resource Bounds for Self-Stabilizing Message-Driven Protocols
cites work: Self-stabilization of dynamic systems assuming only read/write atomicity
cites work: Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
cites work: On the complexity of distributed graph coloring with local minimality constraints
cites work: Fault-containing self-stabilizing distributed protocols
cites work: A self-stabilizing algorithm for coloring planar graphs
cites work: High Performance Computing - HiPC 2003
cites work: Q4368728
cites work: Self-stabilizing algorithms for minimal dominating sets and maximal independent sets
cites work: Maximal matching stabilizes in time \(O(m)\)
cites work: Linear time self-stabilizing colorings
cites work: A self-stabilizing algorithm for maximal matching
cites work: Self-stabilizing coloration in anonymous planar networks
cites work: A self-stabilizing algorithm for finding a minimal 2-dominating set assuming the distributed demon model
cites work: A SELF-STABILIZING DISTRIBUTED APPROXIMATION ALGORITHM FOR THE MINIMUM CONNECTED DOMINATING SET
cites work: Q4414507
cites work: What cannot be computed locally!
cites work: Locality in Distributed Graph Algorithms
cites work: A new self-stabilizing maximal matching algorithm
cites work: A self-stabilizing \(\frac23\)-approximation algorithm for the maximum matching problem
cites work: Stabilization-preserving atomicity refinement
cites work: Principles of Distributed Systems
cites work: An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
cites work: A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
cites work: A self-stabilizing algorithm for coloring bipartite graphs
cites work: Maximal matching stabilizes in quadratic time
cites work: Linear self-stabilizing algorithms for the independent and dominating set problems using an unfair distributed scheduler
cites work: A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
cites work: Distributed Computing - IWDC 2003
DOI: 10.1016/J.JPDC.2009.11.006
description: scientific article; zbMATH DE number 6012835