Multipath spanners via fault-tolerant spanners
From MaRDI portal
(Redirected from Multipath spanners via fault-tolerant spanners)
Recommendations
Cites work
- A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners
- An Optimal Synchronizer for the Hypercube
- Approximate distance oracles
- Average size of unstretched remote-spanners
- Compact roundtrip routing in directed networks
- Compact routing with minimum stretch
- Computing almost shortest paths
- Deterministic distributed vertex coloring in polylogarithmic time
- Efficient algorithms for constructing \((1+{\epsilon}, {\beta})\)-spanners in the distributed and streaming models
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
- Fault-tolerant spanners
- Fault-tolerant spanners for general graphs
- Graph spanners
- scientific article; zbMATH DE number 2079365 (Why is no real title available?)
- Low Distortion Spanners
- Multipath spanners
- Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
- On sparse spanners of weighted graphs
- Performance of multipath routing for on-demand protocols in mobile ad hoc networks
- Roundtrip spanners and roundtrip routing in directed graphs
- Spanners and message distribution in networks.
Cited in
(6)
This page was built for publication: Multipath spanners via fault-tolerant spanners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916037)