Pages that link to "Item:Q4012441"

The following pages link to Routing with Polynomial Communication-Space Trade-Off (Q4012441):

Displaying 27 items.

• Space-efficient path-reporting approximate distance oracles (Q517013) (← links)
• Strong-diameter decompositions of minor free graphs (Q613118) (← links)
• Approximation of minimum weight spanners for sparse graphs (Q627187) (← links)
• A faster distributed protocol for constructing a minimum spanning tree (Q856405) (← links)
• Average stretch analysis of compact routing schemes (Q875595) (← links)
• On sparse spanners of weighted graphs (Q1196368) (← links)
• Graph theoretical issues in computer networks (Q1319540) (← links)
• Optimal layouts on a chain ATM network (Q1392534) (← links)
• Simple and efficient network decomposition and synchronization (Q1575640) (← links)
• New pairwise spanners (Q1693988) (← links)
• Sublinear fully distributed partition with applications (Q1959378) (← links)
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
• Distributed distance computation and routing with small messages (Q2422769) (← links)
• Deterministic M2M multicast in radio networks (Q2508975) (← links)
• Distributed strong diameter network decomposition (Q2672581) (← links)
• Prioritized Metric Structures and Embedding (Q2941541) (← links)
• Small Stretch Pairwise Spanners and Approximate $D$-Preservers (Q3452163) (← links)
• A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs (Q3599135) (← links)
• A complete characterization of the path layout construction problem for ATM networks with given hop count and load (Q4571983) (← links)
• Distributed Spanner Approximation (Q4997324) (← links)
• (Q5090437) (← links)
• Universal routing schemes (Q5137328) (← links)
• Sparse communication networks and efficient routing in the plane (Q5138362) (← links)
• Compact and localized distributed data structures (Q5138487) (← links)
• Compact roundtrip routing with topology-independent node names (Q5900132) (← links)
• Interval routing schemes (Q5916403) (← links)
• Close to linear space routing schemes (Q5964899) (← links)