Login / Signup
Computing the Girth of a Planar Graph in O(n logn) Time.
Oren Weimann
Raphael Yuster
Published in:
SIAM J. Discret. Math. (2010)
Keyphrases
</>
planar graphs
lower bound
dynamic programming
probability distribution