Constant girth approximation for directed graphs in subquadratic time

DOI10.1145/3357713.3384330OpenAlexW3034665992MaRDI QIDQ5144985

No author found.

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1907.10779

zbMATH Keywords

graphsgirthspanners

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

A fast algorithm for source-wise round-trip spanners ⋮ Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs

This page was built for publication: Constant girth approximation for directed graphs in subquadratic time