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

Adam Karczmarz; Da Wei Zheng

doi:10.1137/1.9781611978322.147

SODA2025Top-tier venue

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

Adam Karczmarz, Da Wei Zheng

DOI Publisher

2025Year

1Top-tier citations

Abstract

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:

Ask about this paper

Ask your agent about it.

Lune has read the top-tier papers around this one, so every answer names the papers it rests on.

What it claims
Who builds on it
How it compares
Where it falls short

You ask

Your agent calls

Lunesearch_papers

Ask in Lune

Free to start. No credit card required.

Terminal

Install the CLI

$ lune papers get e2e4a1ee-3972-430e-9e83-5fb223ad6922

Cited by top-tier papers1

Truly Subquadratic Time Algorithms for Diameter and Related Problems in Graphs of Bounded VC-dimensionTimothy M. Chan, Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak et al.FOCS 2025 · 1 citation

Ask how each one uses it

Abstract

Ask about this paper

Ask your agent about it.

Cited by top-tier papers1

Related papers