Pages that link to "Item:Q1881298"
From MaRDI portal
The following pages link to A distributed algorithm for constructing a minimum diameter spanning tree (Q1881298):
Displaying 15 items.
- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots (Q259059) (← links)
- Distributed finite-time calculation of node eccentricities, graph radius and graph diameter (Q286507) (← links)
- Modeling and solving the bi-objective minimum diameter-cost spanning tree problem (Q486390) (← links)
- Algorithms for the minimum diameter terminal Steiner tree problem (Q489734) (← links)
- An efficient distributed algorithm for centering a spanning tree of a biconnected graph (Q671408) (← links)
- Minimum diameter vertex-weighted Steiner tree (Q2039644) (← links)
- A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem (Q2201993) (← links)
- Maintaining balanced trees for structured distributed streaming systems (Q2410236) (← links)
- Global Synchronization of Pulse-Coupled Oscillators on Trees (Q3176272) (← links)
- (Q4250790) (← links)
- (Q4536977) (← links)
- A linear-time optimal-message distributed algorithm for minimum spanning trees (Q5138511) (← links)
- From sequential layers to distributed processes (Q5348853) (← links)
- An efficient distributed algorithm for finding all hinge vertices in networks (Q5466762) (← links)
- A uniform self-stabilizing minimum diameter spanning tree algorithm (Q6084561) (← links)
