Skip to content

Author

Eliyahu Yablon

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Approximating the Girth of an Undirected, Weighted Graph for Larger Approximation Factors

The girth of a weighted undirected graph is defined as the length of a shortest cycle in the graph. In this paper, we give a randomized $O\left(m^{1+2/(k-1)} n^{1/(k-1)}\right)$ algorithm to approximate the girth of a graph with $n$ vertices and $m$ edges to within a factor of $k$ for any real $k$. We assume that all e...

Eliyahu Yablon · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.