Efficient maximum clique computation and enumeration over large sparse graphs
Crossref DOI link: https://doi.org/10.1007/s00778-020-00602-z
Published Online: 2020-02-15
Published Print: 2020-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chang, Lijun http://orcid.org/0000-0002-6830-3900
Text and Data Mining valid from 2020-02-15
Version of Record valid from 2020-02-15
Article History
Received: 13 June 2019
Revised: 15 January 2020
Accepted: 5 February 2020
First Online: 15 February 2020