Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (Q1749842): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114826625, #quickstatements; #temporary_batch_1710289860281
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ins.2014.06.035 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ins.2014.06.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2057824797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beeping a maximal independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Biological Solution to a Fundamental Distributed Computing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant-based algorithm for coloring graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for some graph problems on a distributed computational model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deploying Wireless Networks with Beeps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An experimental analysis of simple, distributed vertex coloring algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring with local minimality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring on coarse grained multicomputers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euro-Par 2004 Parallel Processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time self-stabilizing colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Legal coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple distributed \(\Delta+1\)-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simple distributed algorithms for sparse networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback from nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.INS.2014.06.035 / rank
 
Normal rank

Latest revision as of 08:07, 11 December 2024

scientific article
Language Label Description Also known as
English
Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
scientific article

    Statements

    Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge (English)
    0 references
    0 references
    0 references
    17 May 2018
    0 references
    bio-inspired algorithm
    0 references
    distributed computing
    0 references
    greedy colouring
    0 references
    randomised algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references