Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more

Adam Karczmarz, Da Wei Zheng

Le and Wulff-Nilsen [SODA '24] initiated a systematic study of VC set systems to unweighted $K_h$-minor-free directed graphs. We extend their results in the following ways: $\bulle…