Heather M. Guarnera

activity

20192021

collaborators

5 papers

cs.DS2021

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…

cs.DM2020

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…

cs.DM2020

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 $G$ is called $α$ -weakly-Helly if any system of pairwise intersecting disks in $G$ has a nonempty common inter…

cs.DM2020

Eccentricity terrain of $δ$ -hyperbolic graphs

Feodor F. Dragan, Heather M. Guarnera

A graph $G = (V, E)$ is $δ$ -hyperbolic if for any four vertices $u, v, w, x$ , the two larger of the three distance sums $d (u, v) + d (w, x)$ , $d (u, w) + d (v, x)$ , and $d (u, x) + d (v, w)$ differ by at…

cs.DM2019

Eccentricity function in distance-hereditary graphs

Feodor F. Dragan, Heather M. Guarnera

A graph $G = (V, E)$ is distance hereditary if every induced path of $G$ is a shortest path. In this paper, we show that the eccentricity function $e (v) = max {d (v, u) : u \in V}$ in any…

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

Injective hulls of various graph classes

Helly-gap of a graph and vertex eccentricities

Eccentricity terrain of δ-hyperbolic graphs

Eccentricity function in distance-hereditary graphs

Eccentricity terrain of $δ$ -hyperbolic graphs