Algorithms for computing maximum cliques in hyperbolic random graphs

DOI10.4230/LIPICS.ESA.2023.85MaRDI QIDQ6657050zbMATH OpenFDO

Authors Eunjin Oh, Seunghyeok Oh

Publication date 6 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2023.85

zbMATH Keywords

maximum cliqueshyperbolic random graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cited in

(1)

• Dynamic parameterized problems on unit disk graphs

This page was built for publication: Algorithms for computing maximum cliques in hyperbolic random graphs

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