scientific article; zbMATH DE number 7650910

DOI10.4230/LIPIcs.STACS.2020.25MaRDI QIDQ5874296

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Philipp Fischbeck

Publication date: 7 February 2023

Full work available at URL: https://arxiv.org/abs/1904.12503

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random graphshyperbolic geometryvertex coverefficient algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (3)

Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry ⋮ Solving vertex cover in polynomial time on hyperbolic random graphs ⋮ On the largest component of subcritical random hyperbolic graphs

This page was built for publication: