Due to the sheer size of real-world networks, delay and space have become quite relevant measures of the cost of enumerating patterns for network analytics. This paper presents efficient algorithms for listing maximal cliques in undirected graphs, providing the first sublinear-space bounds with guaranteed delay per solution.
Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
Conte A.
;Grossi R.;Marino A.;Versari L.
2020-01-01
Abstract
Due to the sheer size of real-world networks, delay and space have become quite relevant measures of the cost of enumerating patterns for network analytics. This paper presents efficient algorithms for listing maximal cliques in undirected graphs, providing the first sublinear-space bounds with guaranteed delay per solution.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
