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

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

Open source

DOI
10.1016/j.jcss.2024.103606
Published
2025-05
Container
Journal of Computer and System Sciences
Publisher
Elsevier BV
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1016/j.jcss.2024.103606,
  title = {Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs},
  author = {Feodor F. Dragan and Guillaume Ducoffe and Heather M. Guarnera},
  year = {2025},
  journal = {Journal of Computer and System Sciences},
  doi = {10.1016/j.jcss.2024.103606},
  url = {https://doi.org/10.1016/j.jcss.2024.103606}
}

RIS

TY  - JOUR
TI  - Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
AU  - Feodor F. Dragan
AU  - Guillaume Ducoffe
AU  - Heather M. Guarnera
PY  - 2025
JO  - Journal of Computer and System Sciences
DO  - 10.1016/j.jcss.2024.103606
UR  - https://doi.org/10.1016/j.jcss.2024.103606
ER  - 

APA

Dragan, F. F., Ducoffe, G., & Guarnera, H. M. (2025). Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs. Journal of Computer and System Sciences. https://doi.org/10.1016/j.jcss.2024.103606

Source records