AbstractWe show that the vertex visited last by a LexBFS has eccentricity at least diam(G)−2 for house-hole-free graphs, at least diam(G)−1 for house-hole-domino-free graphs, and equal to diam(G) for house-hole-domino-free and AT-free graphs. To prove these results we use special metric properties of house-hole-free graphs with respect to LexBFS
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
In the past, it has been shown that the diameter of some asteroidal triple-free (AT-free) graphs can...
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is centr...
AbstractWe show that the vertex visited last by a LexBFS has eccentricity at least diam(G)−2 for hou...
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
We introduce notions of certificates allowing to bound eccentricities in a graph. In particular , we...
International audienceUnder the Strong Exponential-Time Hypothesis, the diameter of general unweight...
A well-known problem for which it is difficult to improve the textbook algorithm is computing the gr...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
International audienceUnder the Strong Exponential-Time Hypothesis, the diameter of general unweight...
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
In the past, it has been shown that the diameter of some asteroidal triple-free (AT-free) graphs can...
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is centr...
AbstractWe show that the vertex visited last by a LexBFS has eccentricity at least diam(G)−2 for hou...
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
AbstractDetermining the diameter of a graph is a fundamental graph operation, yet no efficient (i.e....
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
Full version of an IPEC'22 paperAn extremity is a vertex such that the removal of its closed neighbo...
AbstractLet G be a bridgeless connected undirected (b.c.u.) graph. The oriented diameter of G, OD(G)...
We introduce notions of certificates allowing to bound eccentricities in a graph. In particular , we...
International audienceUnder the Strong Exponential-Time Hypothesis, the diameter of general unweight...
A well-known problem for which it is difficult to improve the textbook algorithm is computing the gr...
The diameter, radius and eccentricities are natural graph parameters. While these problems have been...
International audienceUnder the Strong Exponential-Time Hypothesis, the diameter of general unweight...
We show that the eccentricity of every vertex in an undirected graph on n vertices can be computed i...
In the past, it has been shown that the diameter of some asteroidal triple-free (AT-free) graphs can...
Computing the diameter of a graph, i.e. the largest distance, is a fundamental problem that is centr...
DOI
Add to ORKG