A fast and complete algorithm for enumerating pseudo-cliques in large graphs
Crossref DOI link: https://doi.org/10.1007/s41060-016-0022-1
Published Online: 2016-09-16
Published Print: 2016-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Zhai, Hongjie
Haraguchi, Makoto
Okubo, Yoshiaki
Tomita, Etsuji
License valid from 2016-09-16