Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (Q518926): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: A fast and simple randomized parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed (δ+1)-coloring in linear (in δ) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Distributed Vertex Coloring in Polylogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Locality of Distributed Symmetry Breaking / 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: Stone age distributed computing / 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: Parallel Symmetry-Breaking in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knowledge and common knowledge in a distributed environment / 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: Symmetry breaking in distributed networks / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of being near-sighted / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of distributed graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2889027 / 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: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: About randomised distributed graph colouring and graph partition algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal bit complexity randomized distributed MIS algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in radio networks / 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: On the Complexity of Distributed Network Decomposition / 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: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A log-star distributed maximal independent set algorithm for growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new technique for distributed symmetry breaking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback from nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Neural-Like P Systems for Maximal Independent Set Selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank

Revision as of 14:42, 13 July 2024

scientific article
Language Label Description Also known as
English
Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring
scientific article

    Statements

    Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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