Distributed algorithms for weighted problems in sparse graphs (Q866546): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Distributed Algorithm for Better Approximation of the Maximum Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithm for approximating the maximum matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient distributed algorithm for constructing small dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-time distributed dominating set approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed construction of <i>k</i>-dominating sets and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Weighted Matching / rank
 
Normal rank

Revision as of 13:31, 25 June 2024

scientific article
Language Label Description Also known as
English
Distributed algorithms for weighted problems in sparse graphs
scientific article

    Statements

    Distributed algorithms for weighted problems in sparse graphs (English)
    0 references
    14 February 2007
    0 references
    distributed algorithms
    0 references
    approximation algorithms
    0 references
    maximum-weight matching
    0 references
    minimum-weight dominating set
    0 references
    minimum-weight independent set
    0 references
    0 references
    0 references

    Identifiers