A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic and self-stabilizing distributed matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2782251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilization of dynamic systems assuming only read/write atomicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-containing self-stabilizing distributed protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing algorithm for maximal matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of Self-stabilizing Vertex Cover Less Than 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new self-stabilizing maximal matching algorithm / 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: A simple local 3-approximation algorithm for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anonymous self-stabilizing algorithm for 1-maximal independent set in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems / rank
 
Normal rank

Revision as of 07:34, 4 July 2024

scientific article
Language Label Description Also known as
English
A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks
scientific article

    Statements

    A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (English)
    0 references
    0 references
    0 references
    22 July 2011
    0 references
    self-stabilizing algorithms
    0 references
    vertex cover
    0 references
    anonymous networks
    0 references

    Identifiers

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