2026-07-28T19:12:38Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6292 2024-03-06T10:37:58Z ddc:004 open_access

Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques Conte, Alessio Grossi, Roberto Marino, Andrea Versari, Luca Enumeration algorithms maximal cliques network mining and analytics reverse search space efficiency Due to the sheer size of real-world networks, delay and space become quite relevant measures for the cost of enumeration in network analytics. This paper presents efficient algorithms for listing maximum cliques in networks, providing the first sublinear-space bounds with guaranteed delay per enumerated clique, thus comparing favorably with the known literature. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Alessio Conte and Roberto Grossi and Andrea Marino and Luca Versari 2016 Is Part Of LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2016.148 urn:nbn:de:0030-drops-62927 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.148 eng https://creativecommons.org/licenses/by/3.0/legalcode