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 12 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)
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph (Q671408) (← links)
- A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938) (← links)
- A self-stabilizing algorithm which finds a 2-center of a tree (Q1586255) (← links)
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph (Q1608394) (← links)
- A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity (Q1779602) (← links)
- A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph (Q1903205) (← links)
- A self-stabilizing algorithm for finding weighted centroid in trees (Q2443010) (← links)
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS (Q4675877) (← links)
- Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees (Q5087837) (← links)
- A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
