Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

Feodor F. Dragan, Guillaume Ducoffe, Heather M. Guarnera

A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. The class of Helly graphs is the discrete analogue of the class of hyperconvex m…