Pages that link to "Item:Q3440267"

The following pages link to Sparse Sourcewise and Pairwise Distance Preservers (Q3440267):

Displaying 25 items.

• On resilient graph spanners (Q289925) (← links)
• Graph spanners: a tutorial review (Q2026289) (← links)
• A fast algorithm for source-wise round-trip spanners (Q2034785) (← links)
• A note on distance-preserving graph sparsification (Q2059887) (← links)
• Light spanners for high dimensional norms via stochastic decompositions (Q2088589) (← links)
• Demand-aware network designs of bounded degree (Q2189175) (← links)
• Source-wise round-trip spanners (Q2628274) (← links)
• Assisted Identification of Mode of Operation in Binary Code with Dynamic Data Flow Slicing (Q2822697) (← links)
• Improved Purely Additive Fault-Tolerant Spanners (Q3452780) (← links)
• A Hierarchy of Lower Bounds for Sublinear Additive Spanners (Q4561267) (← links)
• (Q5009573) (← links)
• (Q5009588) (← links)
• Lossless Prioritized Embeddings (Q5088604) (← links)
• Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
• Distance-Preserving Subgraphs of Interval Graphs (Q5111726) (← links)
• (Q5111733) (← links)
• (Q5116490) (← links)
• Lower Bounds on Sparse Spanners, Emulators, and Diameter-Reducing Shortcuts (Q5157382) (← links)
• Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
• Improved Guarantees for Vertex Sparsification in Planar Graphs (Q5208743) (← links)
• Distance-Preserving Graph Contractions (Q5233754) (← links)
• New Results on Linear Size Distance Preservers (Q5858650) (← links)
• Distributed construction of purely additive spanners (Q5915631) (← links)
• Reachability Preservers: New Extremal Bounds and Approximation Algorithms (Q6154193) (← links)
• Improved sourcewise roundtrip spanners with constant stretch (Q6591481) (← links)