\alpha _i-Metric Graphs: Radius, Diameter and all Eccentricities
From MaRDI portal
Publication:6496552
DOI10.1007/978-3-031-43380-1_20MaRDI QIDQ6496552FDOQ6496552
Feodor F. Dragan, Guillaume Ducoffe
Publication date: 3 May 2024
Cites Work
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Network Analysis
- Diameter determination on restricted graph families
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- 1-Hyperbolic Graphs
- Eccentricity-approximating trees in chordal graphs
- Conditions for invariance of set diameters under d-convexification in a graph
- A simple linear-time algorithm for computing the center of an interval graph
- Title not available (Why is that?)
- Approximating the Diameter of Planar Graphs in Near Linear Time
- Into the square: on the complexity of some quadratic-time solvable problems
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
- Eccentricity terrain of \(\delta\)-hyperbolic graphs
- Eccentricity approximating trees
- Title not available (Why is that?)
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Fast approximation of eccentricities and distances in hyperbolic graphs
- Eccentricity function in distance-hereditary graphs
- Title not available (Why is that?)
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Title not available (Why is that?)
- Better Approximation Algorithms for the Graph Diameter
- Finding a central vertex in an HHD-free graph
- Easy computation of eccentricity approximating trees
- On the power of BFS to determine a graph's diameter
- Towards tight approximation bounds for graph diameter and eccentricities
- A story of diameter, radius, and (almost) Helly property
- Beyond Helly graphs: the diameter problem on absolute retracts
- Distance problems within Helly graphs and \(k\)-Helly graphs
- The diameter of AT‐free graphs
Cited In (1)
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)