14 citations · 55 across the 23 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019★ 6 cited
A story of diameter, radius and Helly property
Feodor F. Dragan, Guillaume Ducoffe
A graph is Helly if every family of pairwise intersecting balls has a nonempty common intersection. Motivated by previous work on dually chordal graphs and graphs of bounded distan…
cs.DM2019★ 14 cited
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…
cs.DB2019★ 1 cited
Pruned Landmark Labeling Meets Vertex Centric Computation: A Surprisingly Happy Marriage!
Ruoming Jin, Zhen Peng, Wendell Wu +3
In this paper, we study how the Pruned Landmark Labeling (PPL) algorithm can be parallelized in a scalable fashion, producing the same results as the sequential algorithm. More spe…