{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T17:51:42Z","timestamp":1740160302066,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soc. Netw. Anal. Min."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s13278-021-00820-5","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T09:02:33Z","timestamp":1639386153000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing small temporal modules in time logarithmic in history length"],"prefix":"10.1007","volume":"12","author":[{"given":"Binh-Minh","family":"Bui-Xuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7897-0838","authenticated-orcid":false,"given":"Hugo","family":"Hourcade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Miachon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,13]]},"reference":[{"issue":"2","key":"820_CR1","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"BM Bui-Xuan","year":"2003","unstructured":"Bui-Xuan BM, Ferreira A, Jarry A (2003) Computing shortest, fastest, and foremost journeys in dynamic networks. Int J Found Comput Sci 14(2):267\u2013285","journal-title":"Int J Found Comput Sci"},{"key":"820_CR2","doi-asserted-by":"crossref","unstructured":"Bui-Xuan B, Hourcade H, Miachon C (2020) Computing temporal twins in time logarithmic in history length. In: 9th International conference on complex networks and their applications, SCI, vol 944. pp 651\u2013663","DOI":"10.1007\/978-3-030-65351-4_52"},{"key":"820_CR3","doi-asserted-by":"crossref","unstructured":"Casteigts A, Flocchini P, Godard E, Santoro N, Yamashita M (2013) Expressivity of time-varying graphs. In: 19th International symposium on fundamentals of computation theory. pp 95\u2013106 (2013)","DOI":"10.1007\/978-3-642-40164-0_12"},{"key":"820_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3274661","volume":"23","author":"J Dibbelt","year":"2018","unstructured":"Dibbelt J, Pajor T, Strasser B, Wagner D (2018) Connection scan algorithm. ACM J Exp Algorithmics 23:1\u201356","journal-title":"ACM J Exp Algorithmics"},{"key":"820_CR5","doi-asserted-by":"publisher","DOI":"10.1142\/4197","volume-title":"The theory of 2-structures: a framework for decomposition and transformation of graphs","author":"A Ehrenfeucht","year":"1999","unstructured":"Ehrenfeucht A, Harju T, Rozenberg G (1999) The theory of 2-structures: a framework for decomposition and transformation of graphs. World Scientific, Singapore"},{"key":"820_CR6","doi-asserted-by":"crossref","unstructured":"Erlebach T, Hoffmann M, Kammer F (2015) On temporal graph exploration. In: 42nd international colloquium on automata, languages, and programming, LNCS, vol 9134. pp 444\u2013455","DOI":"10.1007\/978-3-662-47672-7_36"},{"issue":"4","key":"820_CR7","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1007\/s00453-012-9714-7","volume":"68","author":"L Foschini","year":"2014","unstructured":"Foschini L, Hershberger J, Suri S (2014) On the complexity of time-dependent shortest paths. Algorithmica 68(4):1075\u20131097","journal-title":"Algorithmica"},{"issue":"1","key":"820_CR8","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cosrev.2010.01.001","volume":"4","author":"M Habib","year":"2010","unstructured":"Habib M, Paul C (2010) A survey of the algorithmic aspects of modular decomposition. Comput Sci Rev 4(1):41\u201359","journal-title":"Comput Sci Rev"},{"issue":"2","key":"820_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M Habib","year":"1999","unstructured":"Habib M, Paul C, Viennot L (1999) Partition refinement techniques: an interesting algorithmic tool kit. Int J Found Comput Sci 10(2):147\u2013170","journal-title":"Int J Found Comput Sci"},{"key":"820_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00453-009-9332-1","volume":"60","author":"S Heber","year":"2011","unstructured":"Heber S, Mayr R, Stoye J (2011) Common intervals of multiple permutations. Algorithmica 60:175\u2013206","journal-title":"Algorithmica"},{"issue":"4","key":"820_CR11","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1006\/jcss.2002.1829","volume":"64","author":"D Kempe","year":"2002","unstructured":"Kempe D, Kleinberg J, Kumar A (2002) Connectivity and inference problems for temporal networks. J Comput Syst Sci 64(4):820\u2013842","journal-title":"J Comput Syst Sci"},{"key":"820_CR12","unstructured":"Klimt B, Yang Y (2004) Introducing the Enron Corpus. In: CEAS"},{"issue":"61","key":"820_CR13","first-page":"1","volume":"8","author":"M Latapy","year":"2018","unstructured":"Latapy M, Viard T, Magnien C (2018) Stream graphs and link streams for the modeling of interactions over time. Soc Netw Anal Min 8(61):1\u201329","journal-title":"Soc Netw Anal Min"},{"issue":"1","key":"820_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/TMC.2010.253","volume":"11","author":"F Ros","year":"2012","unstructured":"Ros F, Ruiz P, Stojmenovic I (2012) Acknowledgment-based broadcast protocol for reliable and efficient data dissemination in vehicular ad-hoc networks. IEEE Trans Mob Comput 11(1):33\u201346","journal-title":"IEEE Trans Mob Comput"},{"key":"820_CR15","volume-title":"Efficient graph representations. Field institute monographs","author":"J Spinrad","year":"2003","unstructured":"Spinrad J (2003) Efficient graph representations. Field institute monographs, vol 19. American Mathematical Society, Providence"},{"key":"820_CR16","doi-asserted-by":"crossref","unstructured":"Tournoux PU, Leguay J, Benbadis F, Conan V, De Amorim MD, Whitbeck J (2009) The accordion phenomenon: analysis, characterization, and impact on DTN routing. In: 28th IEEE conference on computer communications","DOI":"10.1109\/INFCOM.2009.5062024"},{"key":"820_CR17","first-page":"1","volume":"9","author":"I Tsalouchidou","year":"2019","unstructured":"Tsalouchidou I, Baeza-Yates R, Bonchi F, Liao K, Sellis T (2019) Temporal betweenness centrality in dynamic graphs. Int J Data Sci Anal 9:1\u201316","journal-title":"Int J Data Sci Anal"}],"container-title":["Social Network Analysis and Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00820-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13278-021-00820-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13278-021-00820-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T13:37:41Z","timestamp":1672666661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13278-021-00820-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,13]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["820"],"URL":"https:\/\/doi.org\/10.1007\/s13278-021-00820-5","relation":{},"ISSN":["1869-5450","1869-5469"],"issn-type":[{"type":"print","value":"1869-5450"},{"type":"electronic","value":"1869-5469"}],"subject":[],"published":{"date-parts":[[2021,12,13]]},"assertion":[{"value":"30 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"19"}}