Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
type: Item
instance of: scholarly article
title: Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
DOI: 10.1007/978-3-030-83508-8_22
author: Feodor F. Dragan
author: Guillaume Ducoffe
author: Heather M. Guarnera
publication date: 2022-03-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2102.08349
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498685
MaRDI profile type: Publication
OpenAlex ID: W3198400301
cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
cites work: Q3514516
cites work: Dismantling absolute retracts of reflexive graphs
cites work: On Computing the Hyperbolicity of Real-World Graphs
cites work: Into the square: on the complexity of some quadratic-time solvable problems
cites work: The algorithmic use of hypertree structure and maximum neighbourhood orderings
cites work: Dually Chordal Graphs
cites work: Q5009466
cites work: On the hyperbolicity of chordal graphs
cites work: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
cites work: Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
cites work: Weakly Modular Graphs and Nonpositive Curvature
cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs
cites work: Fast approximation of eccentricities and distances in hyperbolic graphs
cites work: Diameter determination on restricted graph families
cites work: Recognition of $C_4$-Free and 1/2-Hyperbolic Graphs
cites work: Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
cites work: Complexity aspects of the Helly property: graphs and hypergraphs
cites work: Q4034774
cites work: Dominating cliques in distance-hereditary graphs
cites work: Obstructions to a small hyperbolicity in Helly graphs
cites work: Eccentricity function in distance-hereditary graphs
cites work: Eccentricity terrain of \(\delta\)-hyperbolic graphs
cites work: Slimness of graphs
cites work: LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
cites work: Q4272121
cites work: Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
cites work: Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
cites work: Computation of the center and diameter of outerplanar graphs
cites work: Computing the Gromov hyperbolicity of a discrete metric space
cites work: Q4607914
cites work: Q3772406
cites work: Six theorems about injective metric spaces
cites work: Hyperbolic bridged graphs
cites work: Network Analysis
cites work: Faster recognition of clique-Helly and hereditary clique-Helly graphs
cites work: A simple linear-time algorithm for computing the center of an interval graph
cites work: Fast approximation algorithms for the diameter and radius of sparse graphs
cites work: Hyperbolicity and chordality of a graph
description: scientific article; zbMATH DE number 7498685