Optimal scale-free compact routing schemes in networks of low doubling dimension
From MaRDI portal
Publication:2934685
zbMATH Open1302.68017MaRDI QIDQ2934685FDOQ2934685
Authors: Goran Konjevod, Donglin Xia, Andrea Richa 
Publication date: 18 December 2014
Recommendations
- Scale-free compact routing schemes in networks of low doubling dimension
- Compact routing with slack in low doubling dimension
- Optimal-stretch name-independent compact routing in doubling metrics
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
- Compact Routing with Name Independence
Deterministic network models in operations research (90B10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10)
Cited In (13)
- Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
- Scale-free compact routing schemes in networks of low doubling dimension
- Compact Routing in Power-Law Graphs
- Optimal-stretch name-independent compact routing in doubling metrics
- Short-length routes in low-cost networks via Poisson line patterns
- Compact routing with slack in low doubling dimension
- Self avoiding paths routing algorithm in scale-free networks
- Additive spanners and distance and routing labeling schemes for hyperbolic graphs
- Distance and routing labeling schemes for cube-free median graphs
- Making doubling metrics geodesic
- Sparse covers for planar graphs and graphs that exclude a fixed minor
- EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS
- A csomagtovábbítás skálázhatósága: korlátok és optimumok
This page was built for publication: Optimal scale-free compact routing schemes in networks of low doubling dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934685)
