{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T02:24:14Z","timestamp":1777343054358,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["NI 369\/12"],"award-info":[{"award-number":["NI 369\/12"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s13278-017-0455-0","type":"journal-article","created":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T14:57:41Z","timestamp":1501513061000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":59,"title":["Adapting the Bron\u2013Kerbosch algorithm for enumerating maximal cliques in temporal graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"Anne-Sophie","family":"Himmel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Sorge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,31]]},"reference":[{"issue":"9","key":"455_CR1","doi-asserted-by":"crossref","first-page":"e107,878","DOI":"10.1371\/journal.pone.0107878","volume":"9","author":"A Barrat","year":"2014","unstructured":"Barrat A, Fournet J (2014) Contact patterns among high school students. PLoS ONE 9(9):e107,878","journal-title":"PLoS ONE"},{"issue":"1","key":"455_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2014.07.001","volume":"544","author":"S Boccaletti","year":"2014","unstructured":"Boccaletti S, Bianconi G, Criado R, Del Genio CI, G\u00f3mez-Garde\u00f1es J, Romance M, Sendi\u00f1a-Nadal I, Wang Z, Zanin M (2014) The structure and dynamics of multilayer networks. Physics Reports 544(1):1\u2013122","journal-title":"Physics Reports"},{"issue":"9","key":"455_CR3","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron C, Kerbosch J (1973) Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM 16(9):575\u2013577","journal-title":"Communications of the ACM"},{"issue":"3","key":"455_CR4","first-page":"3.1:1","volume":"18","author":"D Eppstein","year":"2013","unstructured":"Eppstein D, L\u00e4ffler M, Strash D (2013) Listing all maximal cliques in large sparse real-world graphs in near-optimal time. ACM Journal of Experimental Algorithmics 18(3):3.1:1\u20133.1:21","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"455_CR5","doi-asserted-by":"crossref","unstructured":"Erlebach T, Hoffmann M, Kammer F (2015) On temporal graph exploration. In: Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), Springer, LNCS, vol 9134, pp 444\u2013455","DOI":"10.1007\/978-3-662-47672-7_36"},{"issue":"1","key":"455_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s12879-014-0695-9","volume":"14","author":"V Gemmetto","year":"2014","unstructured":"Gemmetto V, Barrat A, Cattuto C (2014) Mitigation of infectious disease at school: targeted class closure vs school closure. BMC Infectious Diseases 14(1):1","journal-title":"BMC Infectious Diseases"},{"key":"455_CR7","unstructured":"Goerke R (2011) Email network of KIT informatics. http:\/\/i11www.iti.uni-karlsruhe.de\/en\/projects\/spp1307\/emaildata"},{"key":"455_CR8","doi-asserted-by":"crossref","unstructured":"Hagberg AA, Schult DA, Swart PJ (2008) Exploring network structure, dynamics, and function using NetworkX. In: Proceedings of the 7th Python in Science Conference (SciPy 2008), pp 11\u201315","DOI":"10.25080\/TCWV9851"},{"key":"455_CR9","doi-asserted-by":"crossref","unstructured":"Himmel AS (2016) Enumerating maximal cliques in temporal graphs. Bachelorthesis, TU Berlin, URL http:\/\/fpt.akt.tu-berlin.de\/publications\/theses\/BA-anne-sophie-himmel.pdf , bachelor thesis","DOI":"10.1109\/ASONAM.2016.7752255"},{"issue":"3","key":"455_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme P, Saram\u00e4ki J (2012) Temporal networks. Physics Reports 519(3):97\u2013125","journal-title":"Physics Reports"},{"issue":"52","key":"455_CR11","doi-asserted-by":"crossref","first-page":"5384","DOI":"10.1016\/j.tcs.2009.05.008","volume":"410","author":"F H\u00fcffner","year":"2009","unstructured":"H\u00fcffner F, Komusiewicz C, Moser H, Niedermeier R (2009) Isolation concepts for clique enumeration: Comparison and computational experiments. Theoretical Computer Science 410(52):5384\u20135397","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"455_CR12","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.jtbi.2010.11.033","volume":"271","author":"L Isella","year":"2011","unstructured":"Isella L, Stehl\u00e9 J, Barrat A, Cattuto C, Pinton JF, Van den Broeck W (2011) What\u2019s in a crowd? Analysis of face-to-face behavioral networks. Journal of Theoretical Biology 271(1):166\u2013180","journal-title":"Journal of Theoretical Biology"},{"issue":"4","key":"455_CR13","first-page":"40","volume":"5","author":"H Ito","year":"2009","unstructured":"Ito H, Iwama K (2009) Enumeration of isolated cliques and pseudo-cliques. ACM Transactions on Algorithms 5(4):40","journal-title":"ACM Transactions on Algorithms"},{"key":"455_CR14","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg J, Tardos \u00c9 (2006) Algorithm Design. Pearson Education, London"},{"issue":"38","key":"455_CR15","doi-asserted-by":"crossref","first-page":"3640","DOI":"10.1016\/j.tcs.2009.04.021","volume":"410","author":"C Komusiewicz","year":"2009","unstructured":"Komusiewicz C, H\u00fcffner F, Moser H, Niedermeier R (2009) Isolation concepts for efficiently enumerating dense subgraphs. Theoretical Computer Science 410(38):3640\u20133654","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"455_CR16","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s10115-009-0253-8","volume":"24","author":"M Lahiri","year":"2010","unstructured":"Lahiri M, Berger-Wolf TY (2010) Periodic subgraph mining in dynamic networks. Knowledge and Information Systems 24(3):467\u2013497","journal-title":"Knowledge and Information Systems"},{"key":"455_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec J, Kleinberg J, Faloutsos C (2005) Graphs over time: densification laws, shrinking diameters and possible explanations. In: Proceedings of the eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, ACM, pp 177\u2013187","DOI":"10.1145\/1081870.1081893"},{"issue":"4","key":"455_CR18","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/15427951.2016.1177801","volume":"12","author":"O Michail","year":"2016","unstructured":"Michail O (2016) An introduction to temporal graphs: An algorithmic perspective. Internet Mathematics 12(4):239\u2013280","journal-title":"Internet Mathematics"},{"key":"455_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","volume":"634","author":"O Michail","year":"2016","unstructured":"Michail O, Spirakis PG (2016) Traveling salesman problems in temporal graphs. Theoretical Computer Science 634:1\u201323","journal-title":"Theoretical Computer Science"},{"key":"455_CR20","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2015.11.016","volume":"613","author":"KA Naud\u00e9","year":"2016","unstructured":"Naud\u00e9 KA (2016) Refined pivot selection for maximal clique enumeration in graphs. Theoretical Computer Science 613:28\u201337","journal-title":"Theoretical Computer Science"},{"key":"455_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/978-3-642-36461-7_2","volume-title":"Temporal Networks","author":"V Nicosia","year":"2013","unstructured":"Nicosia V, Tang J, Mascolo C, Musolesi M, Russo G, Latora V (2013) Graph metrics for temporal networks. In: Holme P, Saram\u00e4ki J (eds) Temporal Networks. Springer, Berlin Heidelberg, pp 15\u201340"},{"issue":"2","key":"455_CR22","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.socnet.2009.02.002","volume":"31","author":"T Opsahl","year":"2009","unstructured":"Opsahl T, Panzarasa P (2009) Clustering in weighted networks. Social Networks 31(2):155\u2013163","journal-title":"Social Networks"},{"issue":"8","key":"455_CR23","doi-asserted-by":"crossref","first-page":"e23,176","DOI":"10.1371\/journal.pone.0023176","volume":"6","author":"J Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9 J, Voirin N, Barrat A, Cattuto C, Isella L, Pinton JF, Quaggiotto M, Van den Broeck W, R\u00e9gis C, Lina B et al (2011) High-resolution measurements of face-to-face contact patterns in a primary school. PLoS ONE 6(8):e23,176","journal-title":"PLoS ONE"},{"issue":"1","key":"455_CR24","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita E, Tanaka A, Takahashi H (2006) The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science 363(1):28\u201342","journal-title":"Theoretical Computer Science"},{"key":"455_CR25","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.tcs.2015.12.007","volume":"654","author":"T Uno","year":"2016","unstructured":"Uno T, Uno Y (2016) Mining preserving structures in a graph sequence. Theoretical Computer Science 654:155\u2013163","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"455_CR26","doi-asserted-by":"crossref","first-page":"e73,970","DOI":"10.1371\/journal.pone.0073970","volume":"8","author":"P Vanhems","year":"2013","unstructured":"Vanhems P, Barrat A, Cattuto C, Pinton JF, Khanafer N, R\u00e9gis C, Ba Kim, Comte B, Voirin N (2013) Estimating potential infection transmission routes in hospital wards using wearable proximity sensors. PLoS ONE 8(9):e73,970","journal-title":"PLoS ONE"},{"key":"455_CR27","doi-asserted-by":"crossref","unstructured":"Viard J, Latapy M, Magnien C (2015) Revealing contact patterns among high-school students using maximal cliques in link streams. In: Proceedings of the 2015 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, ACM, pp 1517\u20131522","DOI":"10.1145\/2808797.2809291"},{"key":"455_CR28","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.tcs.2015.09.030","volume":"609","author":"T Viard","year":"2016","unstructured":"Viard T, Latapy M, Magnien C (2016) Computing maximal cliques in link streams. Theoretical Computer Science 609:245\u2013252","journal-title":"Theoretical Computer Science"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13278-017-0455-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-017-0455-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-017-0455-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T19:07:42Z","timestamp":1750792062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13278-017-0455-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,31]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["455"],"URL":"https:\/\/doi.org\/10.1007\/s13278-017-0455-0","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"value":"1869-5450","type":"print"},{"value":"1869-5469","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,31]]},"article-number":"35"}}