Pages that link to "Item:Q2900969"
From MaRDI portal
The following pages link to The First Fully Polynomial Stabilizing Algorithm for BFS Tree Construction (Q2900969):
Displaying 4 items.
- Self-stabilizing silent disjunction in an anonymous network (Q507596) (← links)
- An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs (Q906392) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- The first fully polynomial stabilizing algorithm for BFS tree construction (Q2272977) (← links)
