Distance problems within Helly graphs and \(k\)-Helly graphs
From MaRDI portal
Publication:2682928
DOI10.1016/j.tcs.2023.113690OpenAlexW3095569427MaRDI QIDQ2682928
Publication date: 1 February 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.00001
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multivariate analysis of orthogonal range searching and graph distances
- Clique graphs and Helly graphs
- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
- Dismantling absolute retracts of reflexive graphs
- A Radon theorem for Helly graphs
- Computation of the center and diameter of outerplanar graphs
- Helly-type theorems and generalized linear programming
- \(r\)-dominating cliques in graphs with hypertree structure
- LexBFS-orderings and powers of chordal graphs
- The algorithmic use of hypertree structure and maximum neighbourhood orderings
- Finding a central vertex in an HHD-free graph
- Diameter and treewidth in minor-closed graph families
- On constructible graphs, infinite bridged graphs and weakly cop-win graphs
- Domination in quadrangle-free Helly graphs
- Bounded VC-dimension implies a fractional Helly theorem
- Algorithmic graph theory and perfect graphs
- LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem
- Medians in median graphs and their cube complexes in linear time
- Faster recognition of clique-Helly and hereditary clique-Helly graphs
- Six theorems about injective metric spaces
- Helly-gap of a graph and vertex eccentricities
- Graphs with Connected Medians
- A simple linear-time algorithm for computing the center of an interval graph
- Packing and Covering δ-Hyperbolic Spaces by Balls
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Dually Chordal Graphs
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Las Vegas algorithms for linear and integer programming when the dimension is small
- On constructible graphs, locally Helly graphs, and convexity
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
- Fast Diameter Computation within Split Graphs
- Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
- Fast approximation algorithms for the diameter and radius of sparse graphs
- Convexity and fixed-point properties in Helly graphs
- Diameter determination on restricted graph families
This page was built for publication: Distance problems within Helly graphs and \(k\)-Helly graphs
