
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
A graph is Helly if every family of pairwise intersecting balls has a no...
read it

Injective hulls of various graph classes
A graph is Helly if its disks satisfy the Helly property, i.e., every fa...
read it

Hellygap of a graph and vertex eccentricities
A new metric parameter for a graph, Hellygap, is introduced. A graph G ...
read it

Eccentricity terrain of δhyperbolic graphs
A graph G=(V,E) is δhyperbolic if for any four vertices u,v,w,x, the tw...
read it

A story of diameter, radius and Helly property
A graph is Helly if every family of pairwise intersecting balls has a no...
read it

Eccentricity function in distancehereditary graphs
A graph G = (V,E) is distance hereditary if every induced path of G is a...
read it

Fast approximation of centrality and distances in hyperbolic graphs
We show that the eccentricities (and thus the centrality indices) of all...
read it

Fast approximation and exact computation of negative curvature parameters of graphs
In this paper, we study Gromov hyperbolicity and related parameters, tha...
read it

Obstructions to a small hyperbolicity in Helly graphs
It is known that for every graph G there exists the smallest Helly graph...
read it
Feodor F. Dragan
is this you? claim profile