National Institute for Research and Development in Informatics

most citedCertificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs

4 citations

researchers with a paper here

F. Dragan2 · h 34
G. Ducoffe2 · h 14
Laurent Viennot1 · h 3
Michel Habib1 · h 3

collaborating institutions

Kent State UniversityUS2 papers
University of BucharestRO2 papers
Argosy UniversityUS1 paper
Département d'InformatiqueFR1 paper
École Normale Supérieure - PSLFR1 paper
Institut de Recherche en Informatique FondamentaleFR1 paper
Institut national de recherche en sciences et technologies du numériqueFR1 paper
International University of the CaribbeanJM1 paper
Université Paris CitéFR1 paper

2 papers

math.CO2026

$I^\pm_{i}$ -Metric Graphs: Hyperbolicity

Feodor F. Dragan, Guillaume Ducoffe

A graph is called $I^\pm_{i}$ -metric ( $i \in N$ ) if it satisfies the following $I^\pm_{i}$ -metric property for every vertices $u, w, v$ and $x$ : if a shortest path between $u$ and $w$ …

cs.DM2026★ 4 cited

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)…

I^±i​-Metric Graphs: Hyperbolicity

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs

$I^\pm_{i}$ -Metric Graphs: Hyperbolicity