An efficient self-stabilizing distance-2 coloring algorithm
type: Item
instance of: scholarly article
title: An efficient self-stabilizing distance-2 coloring algorithm
zbMATH Open document ID: 1246.68168
author: Jean R. S. Blair
author: Fredrik Manne
published in: Theoretical Computer Science
publication date: 2012-08-10T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 6064607
describes a project that uses: CALMA
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.01.034
OpenAlex ID: W2176143798
cites work: Models and solution techniques for frequency assignment problems
cites work: Q5442385
cites work: Q4198056
cites work: A self-stabilizing algorithm for coloring planar graphs
cites work: SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
cites work: Q4791937
cites work: Linear time self-stabilizing colorings
cites work: Self-stabilizing coloration in anonymous planar networks
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: A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
DOI: 10.1016/J.TCS.2012.01.034
Recommended article: An Efficient Self-stabilizing Distance-2 Coloring Algorithm
Recommended article: A self-stabilizing algorithm for coloring planar graphs
Recommended article: A self-stabilizing algorithm for coloring bipartite graphs
Recommended article: Q3070908
Recommended article: SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS
Recommended article: A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph
Recommended article: Q5442385
Recommended article: Linear time self-stabilizing colorings
description: scientific article; zbMATH DE number 6064607