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.
@InProceedings{conte_et_al:LIPIcs.ICALP.2016.148, author = {Conte, Alessio and Grossi, Roberto and Marino, Andrea and Versari, Luca}, title = {{Sublinear-Space Bounded-Delay Enumeration for Massive Network Analytics: Maximal Cliques}}, booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)}, pages = {148:1--148:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-013-2}, ISSN = {1868-8969}, year = {2016}, volume = {55}, editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.148}, URN = {urn:nbn:de:0030-drops-62927}, doi = {10.4230/LIPIcs.ICALP.2016.148}, annote = {Keywords: Enumeration algorithms, maximal cliques, network mining and analytics, reverse search, space efficiency} }
Feedback for Dagstuhl Publishing