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