Pages that link to "Item:Q4268701"
From MaRDI portal
The following pages link to Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) (Q4268701):
Displaying 19 items.
- Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems (Q5091200) (← links)
- (Q5091203) (← 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)
- Distance-Preserving Graph Contractions (Q5233754) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs (Q5458845) (← links)
- Automata, Languages and Programming (Q5466457) (← links)
- Fast approximation algorithms for the diameter and radius of sparse graphs (Q5495822) (← links)
- (Q5743440) (← links)
- (Q5743466) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
- Approximate proof-labeling schemes (Q5919426) (← links)
- Distributed algorithms for ultrasparse spanners and linear size skeletons (Q5919900) (← links)
- Parameterized complexity of diameter (Q5925618) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- Improved weighted additive spanners (Q6096039) (← links)
- Multi-priority graph sparsification (Q6182885) (← links)