Pages that link to "Item:Q1903205"
From MaRDI portal
The following pages link to A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph (Q1903205):
Displaying 21 items.
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees (Q388463) (← links)
- Spanders: distributed spanning expanders (Q395654) (← 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)
- An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity (Q845956) (← links)
- A self-stabilizing algorithm for constructing breadth-first trees (Q1186586) (← links)
- A self-stabilizing distributed algorithm to find the median of a tree graph (Q1305938) (← links)
- A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. (Q1398776) (← links)
- A dynamic self-stabilizing algorithm for constructing a transport net (Q1599817) (← links)
- A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph (Q1608394) (← links)
- A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets (Q2034405) (← links)
- Optimized silent self-stabilizing scheme for tree-based constructions (Q2072099) (← links)
- The first fully polynomial stabilizing algorithm for BFS tree construction (Q2272977) (← links)
- A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault (Q2303305) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← 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)
- (Q3753476) (← links)
- (Q4536977) (← links)
- A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given (Q5500391) (← links)
- Self-stabilizing metric graphs (Q5920217) (← links)
