Pages that link to "Item:Q4943757"
From MaRDI portal
The following pages link to Self-Stabilizing Algorithms for Finding Centers and Medians of Trees (Q4943757):
Displaying 22 items.
- A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs (Q666086) (← links)
- Improved self-stabilizing algorithms for \(L(2, 1)\)-labeling tree networks (Q691628) (← links)
- A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems (Q845924) (← links)
- Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model (Q1003766) (← links)
- Stabilizing maximum matching in bipartite networks (Q1014349) (← links)
- Median problem in some plane triangulations and quadrangulations. (Q1428459) (← links)
- A self-stabilizing algorithm which finds a 2-center of a tree (Q1586255) (← links)
- A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity (Q1779602) (← links)
- Fault-containing self-stabilizing distributed protocols (Q1954231) (← links)
- A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives (Q2428653) (← links)
- A self-stabilizing algorithm for finding weighted centroid in trees (Q2443010) (← links)
- Self-stabilizing defeat status computation: dealing with conflict management in multi-agent systems (Q2457665) (← links)
- A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity (Q2486565) (← links)
- The impact of the apex node on routing inside a pyramid structure (Q2572332) (← links)
- An optimal self-stabilizing strarvation-free alternator (Q2575834) (← links)
- Weak <i>vs.</i> Self <i>vs.</i> Probabilistic Stabilization (Q2947955) (← links)
- SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS (Q4675877) (← links)
- Argumentation through a distributed self-stabilizing approach (Q4808099) (← links)
- RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES (Q4902882) (← links)
- UPPER BOUNDS FOR SORTING PERMUTATIONS WITH A TRANSPOSITION TREE (Q4928334) (← links)
- Constant Space Self-stabilizing Center Finding Algorithms in Chains and Trees (Q5087837) (← links)
- A self-stabilizing algorithm for the maximum flow problem (Q5137339) (← links)