14 citations · 55 across the 23 of their papers we have counts for
6 papers · 1 filter
Injective hulls of various graph classes
Heather M. Guarnera, Feodor F. Dragan, Arne Leitert
A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, ther…
Helly-gap of a graph and vertex eccentricities
Feodor F. Dragan, Heather M. Guarnera
A new metric parameter for a graph, Helly-gap, is introduced. A graph is called -weakly-Helly if any system of pairwise intersecting disks in has a nonempty common inter…
Eccentricity terrain of -hyperbolic graphs
Feodor F. Dragan, Heather M. Guarnera
A graph is -hyperbolic if for any four vertices , the two larger of the three distance sums , , and differ by at…
Eccentricity function in distance-hereditary graphs
Feodor F. Dragan, Heather M. Guarnera
A graph is distance hereditary if every induced path of is a shortest path. In this paper, we show that the eccentricity function in any…
Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
Feodor F. Dragan, Guillaume Ducoffe, Michel Habib +1
In the context of fine-grained complexity, we investigate the notion of certificate enabling faster polynomial-time algorithms. We specifically target radius (minimum eccentricity)…
Slimness of graphs
Feodor F. Dragan, Abdulhakeem Mohammed
Slimness of a graph measures the local deviation of its metric from a tree metric. In a graph , a geodesic triangle with is the unio…