The following pages link to (Q3138968):
Displayed 11 items.
- A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- On the bandwidth of triangulated triangles (Q1842168) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Covering metric spaces by few trees (Q2168848) (← links)
- Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles (Q3548725) (← links)
- Steiner Point Removal with Distortion $O(\log {k})$ using the Relaxed-Voronoi Algorithm (Q4634019) (← links)
- Low-diameter graph decomposition is in NC (Q5056131) (← links)
- (Q5090925) (← links)
- Covering Metric Spaces by Few Trees (Q5091169) (← links)
- Advances in metric embedding theory (Q5894374) (← links)