most citedPolynomial-time algorithms for the curve graph

7 citations · 7 across the 2 of their papers we have counts for

collaborators

2 papers

math.GT2016★ 7 cited

Polynomial-time algorithms for the curve graph

Mark C. Bell, Richard C. H. Webb

We describe a polynomial-time algorithm to compute a (tight) geodesic between two curves in the curve graph. As well as enabling us to compute the distance between a pair of curves…

math.GR2016

Asymmetric dynamics of outer automorphisms

Mark C. Bell

We consider the action of an irreducible outer automorphism on the closure of Culler--Vogtmann Outer space. This action has north-south dynamics and so, under iteration, points…