2026-07-24T12:07:59Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18738 2024-03-06T11:02:36Z ddc:004 open_access

Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs Oh, Eunjin Oh, Seunghyeok Maximum cliques hyperbolic random graphs In this paper, we study the maximum clique problem on hyperbolic random graphs. A hyperbolic random graph is a mathematical model for analyzing scale-free networks since it effectively explains the power-law degree distribution of scale-free networks. We propose a simple algorithm for finding a maximum clique in hyperbolic random graph. We first analyze the running time of our algorithm theoretically. We can compute a maximum clique on a hyperbolic random graph G in O(m + n^{4.5(1-α)}) expected time if a geometric representation is given or in O(m + n^{6(1-α)}) expected time if a geometric representation is not given, where n and m denote the numbers of vertices and edges of G, respectively, and α denotes a parameter controlling the power-law exponent of the degree distribution of G. Also, we implemented and evaluated our algorithm empirically. Our algorithm outperforms the previous algorithm [BFK18] practically and theoretically. Beyond the hyperbolic random graphs, we have experiment on real-world networks. For most of instances, we get large cliques close to the optimum solutions efficiently. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Eunjin Oh and Seunghyeok Oh 2023 Is Part Of LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ESA.2023.85 urn:nbn:de:0030-drops-187384 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.85 eng https://creativecommons.org/licenses/by/4.0/legalcode