Pages that link to "Item:Q1305938"
From MaRDI portal
The following pages link to A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938):
Displaying 12 items.
- Self-stabilizing algorithms for minimal dominating sets and maximal independent sets (Q597323) (← links)
- An improved algorithm for finding the median distributively (Q1101218) (← links)
- Median problem in some plane triangulations and quadrangulations. (Q1428459) (← links)
- A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity (Q1779602) (← links)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives (Q2428653) (← links)
- SELF-STABILIZING DISTRIBUTED SORTING IN TREE NETWORKS (Q2735236) (← links)
- A SELF-STABILIZING DISTRIBUTED ALGORITHM TO FIND THE CENTER OF A TREE GRAPH (Q3130163) (← links)
- SELF-STABILIZING COMPUTATION OF 3-EDGE-CONNECTED COMPONENTS (Q3173942) (← links)
- (Q4281639) (← links)
- A new characterization of tree medians with applications to distributed sorting (Q4291482) (← links)
- Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees (Q5087837) (← links)
- A Self-stabilizing Algorithm for the Median Problem in Partial Rectangular Grids and Their Relatives (Q5425962) (← links)