{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:03:17Z","timestamp":1775030597999,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T00:00:00Z","timestamp":1677456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-15-CE23-0010-01"],"award-info":[{"award-number":["ANR-15-CE23-0010-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10044-023-01145-z","type":"journal-article","created":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T03:02:36Z","timestamp":1677466956000},"page":"1205-1221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Detecting dynamic patterns in dynamic graphs using subgraph isomorphism"],"prefix":"10.1007","volume":"26","author":[{"given":"Kamaldeep Singh","family":"Oberoi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9raldine","family":"Del Mondo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Ga\u00fcz\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yohan","family":"Dupuis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Vasseur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,27]]},"reference":[{"issue":"3","key":"1145_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte D, Foggia P, Vento M, Sansone C (2004) Thirty years of graph matching in pattern recognition. Int J Pattern Recognit Artif Intell 18(3):265\u2013298. https:\/\/doi.org\/10.1142\/S0218001404003228","journal-title":"Int J Pattern Recognit Artif Intell"},{"issue":"7","key":"1145_CR2","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici V, Giugno R, Pulvirenti A, Shasha D, Ferro A (2013) A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform 14(7):13. https:\/\/doi.org\/10.1186\/1471-2105-14-S7-S13","journal-title":"BMC Bioinform"},{"key":"1145_CR3","doi-asserted-by":"publisher","unstructured":"Fan W (2012) Graph pattern matching revised for social network analysis. In: Proceedings of the 15th international conference on database theory, pp 8\u201321. https:\/\/doi.org\/10.1145\/2274576.2274578","DOI":"10.1145\/2274576.2274578"},{"key":"1145_CR4","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-33460-3_31","volume-title":"Machine learning and knowledge discovery in databases","author":"F Diot","year":"2012","unstructured":"Diot F, Fromont E, Jeudy B, Marilly E, Martinot O (2012) Graph mining for object tracking in videos. In: Flach PA, De Bie T, Cristianini N (eds) Machine learning and knowledge discovery in databases. Springer, Berlin, pp 394\u2013409"},{"issue":"1","key":"1145_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TKDE.2018.2823754","volume":"31","author":"K Semertzidis","year":"2019","unstructured":"Semertzidis K, Pitoura E (2019) Top-$$k$$ durable graph pattern queries on temporal graphs. IEEE Trans Knowl Data Eng 31(1):181\u2013194. https:\/\/doi.org\/10.1109\/TKDE.2018.2823754","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1145_CR6","doi-asserted-by":"publisher","unstructured":"Paranjape A, Benson AR, Leskovec J (2017) Motifs in temporal networks. In: 10th International conference on web search and data mining. ACM, New York, NY, USA, pp 601\u2013610. https:\/\/doi.org\/10.1145\/3018661.3018731","DOI":"10.1145\/3018661.3018731"},{"key":"1145_CR7","doi-asserted-by":"publisher","unstructured":"Mackey P, Porterfield K, Fitzhenry E, Choudhury S, Chin G (2018) A chronological edge-driven approach to temporal subgraph isomorphism. In: 2018 IEEE international conference on big data, pp 3972\u20133979. https:\/\/doi.org\/10.1109\/BigData.2018.8622100","DOI":"10.1109\/BigData.2018.8622100"},{"key":"1145_CR8","doi-asserted-by":"publisher","unstructured":"Locicero G, Micale G, Pulvirenti A, Ferro A (2021) TemporalRI: a subgraph isomorphism algorithm for temporal networks. In: Benito RM, Cherifi C, Cherifi H, Moro E, Rocha LM, Sales-Pardo M (eds) Complex networks & their applications IX. Springer, Cham, pp 675\u2013687. https:\/\/doi.org\/10.1007\/978-3-030-65351-4_54","DOI":"10.1007\/978-3-030-65351-4_54"},{"issue":"1","key":"1145_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s41109-021-00397-0","volume":"6","author":"G Micale","year":"2021","unstructured":"Micale G, Locicero G, Pulvirenti A, Ferro A (2021) TemporalRI: subgraph isomorphism in temporal networks with multiple contacts. Appl Netw Sci 6(1):55\u201315522. https:\/\/doi.org\/10.1007\/s41109-021-00397-0","journal-title":"Appl Netw Sci"},{"key":"1145_CR10","doi-asserted-by":"publisher","unstructured":"Alak\u00f6rkk\u00f6 T, Saram\u00e4ki J (2020) Circadian rhythms in temporal-network connectivity. Chaos Interdiscip J Nonlinear Sci 30(9):093115. https:\/\/doi.org\/10.1063\/5.0004856","DOI":"10.1063\/5.0004856"},{"issue":"45","key":"1145_CR11","doi-asserted-by":"publisher","first-page":"18070","DOI":"10.1073\/pnas.1307941110","volume":"110","author":"L Kovanen","year":"2013","unstructured":"Kovanen L, Kaski K, Kert\u00e9sz J, Saram\u00e4ki J (2013) Temporal motifs reveal homophily, gender-specific patterns, and group talk in call sequences. Proc Natl Acad Sci 110(45):18070\u201318075. https:\/\/doi.org\/10.1073\/pnas.1307941110","journal-title":"Proc Natl Acad Sci"},{"issue":"2","key":"1145_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3172867","volume":"51","author":"G Rossetti","year":"2018","unstructured":"Rossetti G, Cazabet R (2018) Community discovery in dynamic networks: a survey. ACM Comput Surv 51(2):1\u201337. https:\/\/doi.org\/10.1145\/3172867","journal-title":"ACM Comput Surv"},{"issue":"1","key":"1145_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s00354-019-00065-z","volume":"38","author":"A Divakaran","year":"2020","unstructured":"Divakaran A, Mohan A (2020) Temporal link prediction: a survey. New Gener Comput 38(1):213\u2013258. https:\/\/doi.org\/10.1007\/s00354-019-00065-z","journal-title":"New Gener Comput"},{"key":"1145_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.055101","volume":"81","author":"J Tang","year":"2010","unstructured":"Tang J, Scellato S, Musolesi M, Mascolo C, Latora V (2010) Small-world behavior in time-varying graphs. Phys Rev E 81:055101. https:\/\/doi.org\/10.1103\/PhysRevE.81.055101","journal-title":"Phys Rev E"},{"issue":"5","key":"1145_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0195993","volume":"13","author":"J Crawford","year":"2018","unstructured":"Crawford J, Milenkovi\u0107 T (2018) Cluenet: clustering a temporal network based on topological similarity rather than denseness. PLoS ONE 13(5):1\u201325. https:\/\/doi.org\/10.1371\/journal.pone.0195993","journal-title":"PLoS ONE"},{"issue":"4","key":"1145_CR16","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/TPAMI.2017.2696940","volume":"40","author":"V Carletti","year":"2018","unstructured":"Carletti V, Foggia P, Saggese A, Vento M (2018) Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3. IEEE Trans Pattern Anal Mach Intell 40(4):804\u2013818. https:\/\/doi.org\/10.1109\/TPAMI.2017.2696940","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1145_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.06.025","author":"V Carletti","year":"2018","unstructured":"Carletti V, Foggia P, Greco A, Saggese A, Vento M (2018) Comparing performance of graph matching algorithms on huge graphs. Pattern Recognit Lett. https:\/\/doi.org\/10.1016\/j.patrec.2018.06.025","journal-title":"Pattern Recognit Lett"},{"issue":"2","key":"1145_CR18","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.patcog.2014.01.002","volume":"48","author":"M Vento","year":"2015","unstructured":"Vento M (2015) A long trip in the charming world of graphs for pattern recognition. Pattern Recognit 48(2):291\u2013301. https:\/\/doi.org\/10.1016\/j.patcog.2014.01.002","journal-title":"Pattern Recognit"},{"key":"1145_CR19","doi-asserted-by":"publisher","unstructured":"Cook SA (1971) The complexity of theorem-proving procedures. In: Third annual ACM symposium on theory of computing (STOC\u201971). ACM, New York, USA, pp 151\u2013158. https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"1145_CR20","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM 23(1):31\u201342. https:\/\/doi.org\/10.1145\/321921.321925","journal-title":"J ACM"},{"issue":"3","key":"1145_CR21","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1145\/321958.321963","volume":"23","author":"DC Schmidt","year":"1976","unstructured":"Schmidt DC, Druffel LE (1976) A fast backtracking algorithm to test directed graphs for isomorphism using distance matrices. J ACM 23(3):433\u2013445. https:\/\/doi.org\/10.1145\/321958.321963","journal-title":"J ACM"},{"issue":"10","key":"1145_CR22","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372. https:\/\/doi.org\/10.1109\/TPAMI.2004.75","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1145_CR23","doi-asserted-by":"publisher","unstructured":"Almasri I, Gao X, Fedoroff N (2014) Quick mining of isomorphic exact large patterns from large graphs. In: 2014 IEEE international conference on data mining workshop, pp 517\u2013524. https:\/\/doi.org\/10.1109\/ICDMW.2014.65","DOI":"10.1109\/ICDMW.2014.65"},{"issue":"3","key":"1145_CR24","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"JJ McGregor","year":"1979","unstructured":"McGregor JJ (1979) Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf Sci 19(3):229\u2013250. https:\/\/doi.org\/10.1016\/0020-0255(79)90023-9","journal-title":"Inf Sci"},{"issue":"12","key":"1145_CR25","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C Solnon","year":"2010","unstructured":"Solnon C (2010) Alldifferent-based filtering for subgraph isomorphism. Artif Intell 174(12):850\u2013864. https:\/\/doi.org\/10.1016\/j.artint.2010.05.002","journal-title":"Artif Intell"},{"key":"1145_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1671970.1921702","volume":"15","author":"JR Ullmann","year":"2011","unstructured":"Ullmann JR (2011) Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J Exp Algorithmics 15:1\u201361116164. https:\/\/doi.org\/10.1145\/1671970.1921702","journal-title":"J Exp Algorithmics"},{"key":"1145_CR27","doi-asserted-by":"publisher","unstructured":"Giugno R, Shasha D (2002) Graphgrep: a fast and universal method for querying graphs. In: Object recognition supported by user interaction for service robots, vol 2, pp 112\u20131152. https:\/\/doi.org\/10.1109\/ICPR.2002.1048250","DOI":"10.1109\/ICPR.2002.1048250"},{"key":"1145_CR28","doi-asserted-by":"publisher","unstructured":"He H, Singh AK (2008) Graphs-at-a-time: query language and access methods for graph databases. In: International conference on management of data. ACM, New York, NY, USA, pp 405\u2013418. https:\/\/doi.org\/10.1145\/1376616.1376660","DOI":"10.1145\/1376616.1376660"},{"key":"1145_CR29","doi-asserted-by":"publisher","unstructured":"Kovanen L, Karsai M, Kaski K, Kert\u00e9sz J, Saram\u00e4ki, J (2011) Temporal motifs in time-dependent networks. J Stat Mech Theory Exp 11:11005. https:\/\/doi.org\/10.1088\/1742-5468\/2011\/11\/p11005","DOI":"10.1088\/1742-5468\/2011\/11\/p11005"},{"key":"1145_CR30","unstructured":"Redmond U, Cunningham P (2016) Subgraph isomorphism in temporal networks. arXiv preprint arXiv:1605.02174"},{"key":"1145_CR31","unstructured":"Choudhury S, Holder L, Chin, G, Agarwal K, Feo J (2015) A selectivity based approach to continuous pattern detection in streaming graphs. In: 18th International conference on extending database technology, pp 157\u2013168"},{"key":"1145_CR32","doi-asserted-by":"publisher","unstructured":"Sun X, Tan Y, Wu Q, Wang J (2017) Hasse diagram based algorithm for continuous temporal subgraph query in graph stream. In: 6th International conference on computer science and network technology, pp 241\u2013246. https:\/\/doi.org\/10.1109\/ICCSNT.2017.8343695","DOI":"10.1109\/ICCSNT.2017.8343695"},{"key":"1145_CR33","doi-asserted-by":"publisher","unstructured":"Fan, W, Li J, Luo J, Tan Z, Wang X, Wu Y (2011) Incremental graph pattern matching. In: International conference on management of data. ACM, New York, NY, USA, pp 925\u2013936. https:\/\/doi.org\/10.1145\/1989323.1989420","DOI":"10.1145\/1989323.1989420"},{"key":"1145_CR34","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-21233-3_5","volume-title":"Algorithms for computational biology","author":"B Schiller","year":"2015","unstructured":"Schiller B, Jager S, Hamacher K, Strufe T (2015) Stream\u2014a stream-based algorithm for counting motifs in dynamic graphs. In: Dediu A-H, Hern\u00e1ndez-Quiroz F, Mart\u00edn-Vide C, Rosenblueth DA (eds) Algorithms for computational biology. Springer, Cham, pp 53\u201367"},{"issue":"1","key":"1145_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12918-018-0533-6","volume":"12","author":"K Mukherjee","year":"2018","unstructured":"Mukherjee K, Hasan MM, Boucher C, Kahveci T (2018) Counting motifs in dynamic networks. BMC Syst Biol 12(1):1\u201312. https:\/\/doi.org\/10.1186\/s12918-018-0533-6","journal-title":"BMC Syst Biol"},{"key":"1145_CR36","doi-asserted-by":"publisher","unstructured":"Berlingerio M, Bonchi F, Bringmann B, Gionis A (2009) Mining graph evolution rules. In: Buntine W, Grobelnik M, Mladeni\u0107 D, Shawe-Taylor J (eds) Machine learning and knowledge discovery in databases. Springer, pp 115\u2013130. https:\/\/doi.org\/10.1007\/978-3-642-04180-8_25","DOI":"10.1007\/978-3-642-04180-8_25"},{"key":"1145_CR37","doi-asserted-by":"publisher","unstructured":"Cakmak E, Schlegel U, J\u00e4ckle D, Keim D, Schreck T (2021) Multiscale snapshots: visual analysis of temporal summaries in dynamic graphs. IEEE Trans Vis Comput Graph 27(2):517\u2013527. https:\/\/doi.org\/10.1109\/TVCG.2020.3030398","DOI":"10.1109\/TVCG.2020.3030398"},{"key":"1145_CR38","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1613\/jair.5768","volume":"61","author":"C Mccreesh","year":"2018","unstructured":"Mccreesh C, Prosser P, Solnon C, Trimble J (2018) When subgraph isomorphism is really hard, and why this matters for graph databases. J Artif Intell Res 61:723\u2013759. https:\/\/doi.org\/10.1613\/jair.5768","journal-title":"J Artif Intell Res"},{"key":"1145_CR39","unstructured":"Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data. Accessed Jan 2022"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-023-01145-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10044-023-01145-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-023-01145-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T14:04:41Z","timestamp":1690034681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10044-023-01145-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,27]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1145"],"URL":"https:\/\/doi.org\/10.1007\/s10044-023-01145-z","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,27]]},"assertion":[{"value":"24 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}