\alpha _i-Metric Graphs: Radius, Diameter and all Eccentricities

Cites work

scientific article; zbMATH DE number 3838821 (Why is no real title available?)
scientific article; zbMATH DE number 4085714 (Why is no real title available?)
scientific article; zbMATH DE number 23019 (Why is no real title available?)
scientific article; zbMATH DE number 4114700 (Why is no real title available?)
1-Hyperbolic Graphs
A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
A simple linear-time algorithm for computing the center of an interval graph
A story of diameter, radius, and (almost) Helly property
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
Approximating the Diameter of Planar Graphs in Near Linear Time
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
Better approximation algorithms for the graph diameter
Beyond Helly graphs: the diameter problem on absolute retracts
Conditions for invariance of set diameters under d-convexification in a graph
Diameter determination on restricted graph families
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Distance problems within Helly graphs and $k$-Helly graphs
Easy computation of eccentricity approximating trees
Eccentricity approximating trees
Eccentricity function in distance-hereditary graphs
Eccentricity terrain of $\delta$-hyperbolic graphs
Eccentricity-approximating trees in chordal graphs
Fast approximation algorithms for the diameter and radius of sparse graphs
Fast approximation of eccentricities and distances in hyperbolic graphs
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
Finding a central vertex in an HHD-free graph
Into the square: on the complexity of some quadratic-time solvable problems
Network Analysis
On the power of BFS to determine a graph's diameter
The algorithmic use of hypertree structure and maximum neighbourhood orderings
The diameter of AT‐free graphs
Towards tight approximation bounds for graph diameter and eccentricities

Cited in

(1)

$ \alpha_i$-metric graphs: radius, diameter and all eccentricities

This page was built for publication: $$\alpha _i$$-Metric Graphs: Radius, Diameter and all Eccentricities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496552)