Constant Girth Approximation for Directed Graphs in Subquadratic Time

Shiri Chechik, Yang P. Liu, Omer Rotem +1

In this paper we provide a $\tilde{O}(m\sqrt{n})$ time algorithm that computes a $3$-multiplicative approximation of the girth of a $n$-node $m$-edge directed graph with non-negati…