Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
type: Item
instance of: scholarly article
title: Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
zbMATH Open document ID: 1390.90453
author: P. Jeavons
author: Lei Xu
published in: Information Sciences
publication date: 2018-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6869554
zbMATH Keywords: bio-inspired algorithm
zbMATH Keywords: distributed computing
zbMATH Keywords: greedy colouring
zbMATH Keywords: randomised algorithm
MaRDI profile type: Publication
Wikidata QID: Q114826625
full work available at URL: j.ins.2014.06.035
OpenAlex ID: W2057824797
cites work: Beeping a maximal independent set
cites work: A Biological Solution to a Fundamental Distributed Computing Problem
cites work: An ant-based algorithm for coloring graphs
cites work: Algorithms for some graph problems on a distributed computational model
cites work: Deploying Wireless Networks with Beeps
cites work: An experimental analysis of simple, distributed vertex coloring algorithms
cites work: On the complexity of distributed graph coloring with local minimality constraints
cites work: Graph coloring on coarse grained multicomputers
cites work: Q4843270
cites work: On colouring random graphs
cites work: Euro-Par 2004 Parallel Processing
cites work: Linear time self-stabilizing colorings
cites work: Q4142699
cites work: Legal coloring of graphs
cites work: Locality in Distributed Graph Algorithms
cites work: Q3126969
cites work: Simple distributed \(\Delta+1\)-coloring of graphs
cites work: Some simple distributed algorithms for sparse networks
cites work: APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
cites work: Feedback from nature
cites work: Linear degree extractors and the inapproximability of max clique and chromatic number
DOI: 10.1016/J.INS.2014.06.035
description: scientific article; zbMATH DE number 6869554