Computing graph hyperbolicity using dominating sets

DOI10.1137/1.9781611977042.7MaRDI QIDQ6543129zbMATH OpenFDO

Authors David Coudert, André Nusser, Laurent Viennot

Publication date 24 May 2024

zbMATH Keywords

graph algorithmsGromov hyperbolicityalgorithm engineering

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)

Recommendations

• Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
• When can graph hyperbolicity be computed in linear time?
• When can graph hyperbolicity be computed in linear time?
• On computing the Gromov hyperbolicity
• On computing the hyperbolicity of real-world graphs

Cited in

(3)

• Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation
• Core-periphery models for graphs based on their \( \delta \)-hyperbolicity: an example using biological networks
• Leanness computation: small values and special graph classes

This page was built for publication: Computing graph hyperbolicity using dominating sets

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