Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

Cites Work

Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
Title not available (Why is that?)
Six theorems about injective metric spaces
Fast approximation algorithms for the diameter and radius of sparse graphs
Network Analysis
Diameter determination on restricted graph families
A new algorithm for optimal 2-constraint satisfaction and its implications
The algorithmic use of hypertree structure and maximum neighbourhood orderings
Hyperbolic bridged graphs
Dually Chordal Graphs
Hyperbolicity and chordality of a graph
On the hyperbolicity of chordal graphs
Title not available (Why is that?)
Dominating cliques in distance-hereditary graphs
Clique graphs and Helly graphs
Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
Complexity aspects of the Helly property: graphs and hypergraphs
Recognition of \(C_4\)-free and \(1/2\)-hyperbolic graphs
On computing the hyperbolicity of real-world graphs
1-Hyperbolic Graphs
Diameter and treewidth in minor-closed graph families
Computing the Gromov hyperbolicity of a discrete metric space
Dismantling absolute retracts of reflexive graphs
\(r\)-dominating cliques in graphs with hypertree structure
On constructible graphs, infinite bridged graphs and weakly cop-win graphs
Domination in quadrangle-free Helly graphs
Faster recognition of clique-Helly and hereditary clique-Helly graphs
On constructible graphs, locally Helly graphs, and convexity
Slimness of graphs
Metric graph theory and geometry: a survey
Clique Graphs of Chordal and Path Graphs
A simple linear-time algorithm for computing the center of an interval graph
A Radon theorem for Helly graphs
Computation of the center and diameter of outerplanar graphs
LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
Into the square: on the complexity of some quadratic-time solvable problems
Eccentricity terrain of \(\delta\)-hyperbolic graphs
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
Fast approximation of eccentricities and distances in hyperbolic graphs
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
Eccentricity function in distance-hereditary graphs
Obstructions to a small hyperbolicity in Helly graphs
Weakly Modular Graphs and Nonpositive Curvature
Title not available (Why is that?)
Voronoi diagrams on planar graphs, and computing the diameter in deterministic \(\tilde{O}(n^{5/3})\) time
Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs
Fast approximation and exact computation of negative curvature parameters of graphs
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
Title not available (Why is that?)
Convexity and fixed-point properties in Helly graphs
Injective hulls of various graph classes
Optimal centrality computations within bounded clique-width graphs
Helly-gap of a graph and vertex eccentricities
A story of diameter, radius, and (almost) Helly property
Fast diameter computation within split graphs
The diameter of AT‐free graphs
LexBFS-orderings and powers of graphs

This page was built for publication: Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

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