
Diameter, radius and all eccentricities in linear time for constantdimension median graphs
Median graphs form the class of graphs which is the most studied in metr...
read it

(α, β)Modules in Graphs
Modular Decomposition focuses on repeatedly identifying a module M (a co...
read it

Fast Diameter Computation within Split Graphs
When can we compute the diameter of a graph in quasi linear time? We add...
read it

Diameter computation on Hminor free graphs and graphs of bounded (distance) VCdimension
We propose to study unweighted graphs of constant distance VCdimension ...
read it

Graph classes and forbidden patterns on three vertices
This paper deals with graph classes characterization and recognition. A ...
read it

Fast approximation of centrality and distances in hyperbolic graphs
We show that the eccentricities (and thus the centrality indices) of all...
read it

Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates
We introduce notions of certificates allowing to bound eccentricities in...
read it
Michel Habib
is this you? claim profile