Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decrementai reachability, and more
Adam Karczmarz, Da Wei Zheng
2025年份
1顶会引用
摘要
Le and Wulff-Nilsen [SODA ’24] initiated a systematic study of VC set systems to unweighted Kh-minor-free directed graphs. We extend their results in the following ways:
问问这篇 Paper
问问你的智能体。
Lune 读过与它相关的顶会 Paper，每个回答都会注明依据哪几篇。
引用它的顶会 Paper1
问问它们各自怎么用它相关 Paper
- VC Set Systems in Minor-free (Di)Graphs and ApplicationsHung Le, Christian Wulff-NilsenSODA 2024
- New Separations and Reductions for Directed Hopsets and PreserversGary Hoppenworth, Yinzhan Xu, Zixuan XuSODA 2025 · 被引用 2 次
- Proof of the Clustered Hadwiger ConjectureVida Dujmovic, Louis Esperet, Pat Morin, David R. WoodFOCS 2023 · 被引用 7 次
- A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic NumberRomain Bourneuf, Pierre Charbit, Stéphan ThomasséFOCS 2025 · 被引用 13 次
- Local Combinatorial Analogues for Bounded VC DimensionOlga Medrano Martín del CampoLICS 2026
