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.
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques / Conte Alessio; Grossi Roberto; Marino Andrea; Versari Luca. - ELETTRONICO. - 55:(2016), pp. 1-15. (Intervento presentato al convegno 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 tenutosi a ita nel 2016) [10.4230/LIPIcs.ICALP.2016.148].
Sublinear-space bounded-delay enumeration for massive network analytics: Maximal cliques
Grossi Roberto;Marino Andrea;
2016
Abstract
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.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
