An optimal maximal independent set algorithm for bounded-independence graphs (Q992507): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980501142 / 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: Sorting in linear 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 coin tossing with applications to optimal parallel list ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized distributed algorithm for the maximal independent set problem in growth-bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Symmetry-Breaking in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and simple randomized parallel algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of bounded growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: What cannot be computed locally! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Leveraging Linial’s Locality Limit / 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: A weakly robust PTAS for minimum clique partition in unit disk graphs / 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: Coloring unstructured wireless multi-hop networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed agreement in tile self-assembly / rank
 
Normal rank

Latest revision as of 03:46, 3 July 2024

scientific article
Language Label Description Also known as
English
An optimal maximal independent set algorithm for bounded-independence graphs
scientific article

    Statements

    An optimal maximal independent set algorithm for bounded-independence graphs (English)
    0 references
    0 references
    9 September 2010
    0 references
    ad hoc network
    0 references
    sensor network
    0 references
    radio network
    0 references
    unit disk graph
    0 references
    growth bounded graph
    0 references
    bounded-independence graph
    0 references
    local algorithm
    0 references
    parallel algorithm
    0 references
    maximal independent set
    0 references
    maximal matching
    0 references
    dominating set
    0 references
    connected dominating set
    0 references
    coloring
    0 references
    symmetry breaking
    0 references

    Identifiers

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