Sublinear-Space and Bounded-Delay Algorithms for Maximal Clique Enumeration in Graphs
Crossref DOI link: https://doi.org/10.1007/s00453-019-00656-8
Published Online: 2019-12-14
Published Print: 2020-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Conte, Alessio http://orcid.org/0000-0003-0770-2235
Grossi, Roberto
Marino, Andrea
Versari, Luca
Funding for this research was provided by:
Ministero dell’Istruzione, dell’Università e della Ricerca (20174LF3T8)
Text and Data Mining valid from 2019-12-14
Version of Record valid from 2019-12-14
Article History
Received: 29 July 2017
Accepted: 22 November 2019
First Online: 14 December 2019