Adapting the Bron–Kerbosch algorithm for enumerating maximal cliques in temporal graphs
Crossref DOI link: https://doi.org/10.1007/s13278-017-0455-0
Published Online: 2017-07-31
Published Print: 2017-12
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Himmel, Anne-Sophie
Molter, Hendrik
Niedermeier, Rolf
Sorge, Manuel
Funding for this research was provided by:
Deutsche Forschungsgemeinschaft (NI 369/12)
License valid from 2017-07-31