First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
Vazirani , title =
2 Pith papers cite this work, alongside 88 external citations. Polarity classification is still indexing.
2
Pith papers citing it
88
external citations · external index
years
2026 2representative citing papers
The authors establish K_KR ≤ 694198146664396294486127753 / 34994834677886019996000000 ≈ 19.837, halving the original Kalton-Roberts upper bound.
citing papers explorer
-
Real-weighted Diameter and Eccentricity of Minor-free and Bounded VC-dimension Graphs in Truly Subquadratic Time
First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
-
Halving the original Kalton--Roberts upper bound for nearly additive set functions
The authors establish K_KR ≤ 694198146664396294486127753 / 34994834677886019996000000 ≈ 19.837, halving the original Kalton-Roberts upper bound.