Computing graph hyperbolicity using dominating sets

DOI10.1137/1.9781611977042.7MaRDI QIDQ6543129

Laurent Viennot, David Coudert, André Nusser

Publication date: 24 May 2024

zbMATH Keywords

graph algorithmsGromov hyperbolicityalgorithm engineering

Mathematics Subject Classification ID

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

Related Items (1)

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)