Conditionally optimal approximation algorithms for the girth of a directed graph

DOI10.4230/LIPICS.ICALP.2020.35MaRDI QIDQ6842541zbMATH OpenFDO

Authors M. Dalirrooyfard, Virginia Vassilevska Williams

Publication date 18 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

zbMATH Keywords

approximation algorithmsgraph algorithmsgirthshortest cyclefine-grained complexityroundtrip spanner

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Conditionally optimal approximation algorithms for the girth of a directed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6842541)