Computing large independent sets in a single round (Q1699422): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-017-0298-y / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2599155613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beeping a maximal independent set / 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: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Locality of Some NP-Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Network-Decomposition Algorithm and Its Applications to Constant-Time Distributed Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deploying Wireless Networks with Beeps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Approximations in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithms for independent sets in sparse hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wireless scheduling with power control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Algorithms for Coloring Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly optimal bounds for distributed wireless scheduling in the SINR model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Contention Resolution in Wireless Networks / 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: 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: Analysis of fully distributed splitting and naming probabilistic procedures and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal independent sets in radio networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Can be Computed Locally? / 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: An optimal maximal independent set algorithm for bounded-independence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of local algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002782 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-017-0298-Y / rank
 
Normal rank

Latest revision as of 04:33, 11 December 2024

scientific article
Language Label Description Also known as
English
Computing large independent sets in a single round
scientific article

    Statements

    Computing large independent sets in a single round (English)
    0 references
    0 references
    23 February 2018
    0 references
    maximum independent set
    0 references
    bounded-independence graphs
    0 references
    distributed algorithms
    0 references
    randomized algorithms
    0 references
    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