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

Latest revision as of 08: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

instance of

scholarly article

0 references

title

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

0 references

zbMATH Open document ID

1217.68032

0 references

DOI

10.1016/j.tcs.2010.11.010

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

22 July 2011

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

self-stabilizing algorithms

0 references

vertex cover

0 references

anonymous networks

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2010.11.010

0 references

OpenAlex ID

W1981311956

0 references

cites work

A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH

0 references

Complexity of network synchronization

0 references

Dynamic and self-stabilizing distributed matching

0 references

Q2782251

0 references

Self-stabilization of dynamic systems assuming only read/write atomicity

0 references

Fault-containing self-stabilizing distributed protocols

0 references

Q4250185

0 references

Some optimal inapproximability results

0 references

A self-stabilizing algorithm for maximal matching

0 references

Approximation of Self-stabilizing Vertex Cover Less Than 2

0 references

A new self-stabilizing maximal matching algorithm

0 references

Some simple distributed algorithms for sparse networks

0 references

A simple local 3-approximation algorithm for vertex cover

0 references

An anonymous self-stabilizing algorithm for 1-maximal independent set in trees

0 references

A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:555319

@@ Property / Mathematics Subject Classification ID @@
+M14
@@ Property / Mathematics Subject Classification ID: 68M14 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M15
@@ Property / Mathematics Subject Classification ID: 68M15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W40
@@ Property / Mathematics Subject Classification ID: 68W40 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5931179
@@ Property / zbMATH DE Number: 5931179 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+self-stabilizing algorithms
@@ Property / zbMATH Keywords: self-stabilizing algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+vertex cover
@@ Property / zbMATH Keywords: vertex cover / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+anonymous networks
@@ Property / zbMATH Keywords: anonymous networks / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2010.11.010
+Normal rank
@@ Property / OpenAlex ID @@
+W1981311956
@@ Property / OpenAlex ID: W1981311956 / rank @@
+Normal rank
@@ Property / cites work @@
+A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH
+Normal rank
@@ Property / cites work @@
+Complexity of network synchronization
@@ Property / cites work: Complexity of network synchronization / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic and self-stabilizing distributed matching
@@ Property / cites work: Dynamic and self-stabilizing distributed matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q2782251
@@ Property / cites work: Q2782251 / rank @@
+Normal rank
@@ Property / cites work @@
+Self-stabilization of dynamic systems assuming only read/write atomicity
+Normal rank
@@ Property / cites work @@
+Fault-containing self-stabilizing distributed protocols
+Normal rank
@@ Property / cites work @@
+Q4250185
@@ Property / cites work: Q4250185 / rank @@
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+A self-stabilizing algorithm for maximal matching
@@ Property / cites work: A self-stabilizing algorithm for maximal matching / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation of Self-stabilizing Vertex Cover Less Than 2
+Normal rank
@@ Property / cites work @@
+A new self-stabilizing maximal matching algorithm
@@ Property / cites work: A new self-stabilizing maximal matching algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Some simple distributed algorithms for sparse networks
+Normal rank
@@ Property / cites work @@
+A simple local 3-approximation algorithm for vertex cover
+Normal rank
@@ Property / cites work @@
+An anonymous self-stabilizing algorithm for 1-maximal independent set in trees
+Normal rank
@@ Property / cites work @@
+A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:555319