Pages that link to "Item:Q3130163"
From MaRDI portal
The following pages link to A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH (Q3130163):
Displaying 3 items.
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319) (← links)
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets (Q597323) (← links)
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS (Q4675877) (← links)
