A3.D — Conditionally optimal approximation algorithms for the girth of a directed graph

ICALP 2020