{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:54:25Z","timestamp":1767034465692,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030653507"},{"type":"electronic","value":"9783030653514"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-65351-4_54","type":"book-chapter","created":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:03:06Z","timestamp":1609797786000},"page":"675-687","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["TemporalRI: A Subgraph Isomorphism Algorithm for Temporal Networks"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Locicero","sequence":"first","affiliation":[]},{"given":"Giovanni","family":"Micale","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Ferro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"54_CR1","doi-asserted-by":"publisher","unstructured":"Bi, F., Chang, L., Lin, X., Qin, L., Zhang, W.: Efficient subgraph matching by postponing cartesian products. In: SIGMOD 2016, pp. 1199\u20131214 (2016). https:\/\/doi.org\/10.1145\/2882903.2915236","DOI":"10.1145\/2882903.2915236"},{"issue":"Suppl 7","key":"54_CR2","doi-asserted-by":"publisher","first-page":"1","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.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform. 14(Suppl 7), 1\u201313 (2013). https:\/\/doi.org\/10.1186\/1471-2105-14-S7-S13","journal-title":"BMC Bioinform."},{"issue":"1","key":"54_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TCBB.2016.2515595","volume":"14","author":"V Bonnici","year":"2017","unstructured":"Bonnici, V., Giugno, R.: On the variable ordering in subgraph isomorphism algorithms. IEEE\/ACM Trans. Comput. Biol. Bioinform. 14(1), 193\u2013203 (2017). https:\/\/doi.org\/10.1109\/TCBB.2016.2515595","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"10","key":"54_CR4","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Vento, M.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. 26(10), 1367\u20131372 (2004). https:\/\/doi.org\/10.1109\/TPAMI.2004.75","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"54_CR5","doi-asserted-by":"publisher","first-page":"e0195993","DOI":"10.1371\/journal.pone.0195993","volume":"13","author":"J Crawford","year":"2018","unstructured":"Crawford, J., Milenkovic, T.: ClueNet: Clustering a temporal network based on topological similarity rather than denseness. PLoS ONE 13(5), e0195993 (2018). https:\/\/doi.org\/10.1371\/journal.pone.0195993","journal-title":"PLoS ONE"},{"key":"54_CR6","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.: Temporal link prediction: a survey. New Gener. Comput. 38, 213\u2013258 (2020). https:\/\/doi.org\/10.1007\/s00354-019-00065-z","journal-title":"New Gener. Comput."},{"key":"54_CR7","doi-asserted-by":"publisher","unstructured":"Han, W., Lee, J., Lee, J.H.: Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: SIGMOD 2013, pp. 337\u2013348 (2013). https:\/\/doi.org\/10.1145\/2463676.2465300","DOI":"10.1145\/2463676.2465300"},{"key":"54_CR8","doi-asserted-by":"publisher","unstructured":"Han, M., Kim, H., Gu, G., Park, K., Han, W.: Efficient subgraph matching: harmonizing dynamic programming, adaptive matching order, and failing set together. In: SIGMOD 2019, pp. 1429\u20131446 (2019). https:\/\/doi.org\/10.1145\/3299869.3319880","DOI":"10.1145\/3299869.3319880"},{"issue":"2","key":"54_CR9","doi-asserted-by":"publisher","first-page":"023073","DOI":"10.1103\/PhysRevResearch.2.023073","volume":"2","author":"T Hiraoka","year":"2020","unstructured":"Hiraoka, T., Masuda, N., Li, A., Jo, H.: Modeling temporal networks with bursty activity patterns of nodes and links. Phys. Rev. Res. 2(2), 023073 (2020). https:\/\/doi.org\/10.1103\/PhysRevResearch.2.023073","journal-title":"Phys. Rev. Res."},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.physrep.2012.03.001","volume":"519","author":"P Holme","year":"2012","unstructured":"Holme, P., Saramaki, J.: Temporal networks. Phys. Rep. 519, 97\u2013125 (2012). https:\/\/doi.org\/10.1016\/j.physrep.2012.03.001","journal-title":"Phys. Rep."},{"key":"54_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-23495-9","volume-title":"Temporal Network Theory","author":"P Holme","year":"2019","unstructured":"Holme, P., Saramaki, J.: Temporal Network Theory. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-23495-9"},{"issue":"12","key":"54_CR12","doi-asserted-by":"publisher","first-page":"i171","DOI":"10.1093\/bioinformatics\/btv227","volume":"31","author":"Y Hulovatyy","year":"2015","unstructured":"Hulovatyy, Y., et al.: Exploring the structure and function of temporal networks with dynamic graphlets. Bioinformatics 31(12), i171\u2013i180 (2015). https:\/\/doi.org\/10.1093\/bioinformatics\/btv227","journal-title":"Bioinformatics"},{"key":"54_CR13","doi-asserted-by":"publisher","unstructured":"Kim, K., Seo, I., Han, W.S., Lee, J.H., Hong, S., Chafi, H., Shin, H., Jeong, G.: TurboFlux: a fast continuous subgraph matching system for streaming graph data. In: SIGMOD 2018, pp. 411\u2013426 (2018). https:\/\/doi.org\/10.1145\/3183713.3196917","DOI":"10.1145\/3183713.3196917"},{"issue":"12","key":"54_CR14","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1016\/j.physleta.2019.01.041","volume":"383","author":"L Lv","year":"2019","unstructured":"Lv, L., et al.: PageRank centrality for temporal networks. Phys. Lett. A 383(12), 1215\u20131222 (2019). https:\/\/doi.org\/10.1016\/j.physleta.2019.01.041","journal-title":"Phys. Lett. A"},{"issue":"11","key":"54_CR15","doi-asserted-by":"publisher","first-page":"P11005","DOI":"10.1088\/1742-5468\/2011\/11\/p11005","volume":"2011","author":"L Kovanen","year":"2011","unstructured":"Kovanen, L., Karsai, M., Kaski, K., Kert\u00e9sz, J., Saramaki, J.: Temporal motifs in time-dependent networks. J. Stat. Mech. Theor. Exp. 2011(11), P11005 (2011). https:\/\/doi.org\/10.1088\/1742-5468\/2011\/11\/p11005","journal-title":"J. Stat. Mech. Theor. Exp."},{"key":"54_CR16","doi-asserted-by":"publisher","unstructured":"Liu, P., Benson, A.R., Charikar, M.: Sampling methods for counting temporal motifs. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 294\u2013302 (2019). https:\/\/doi.org\/10.1145\/3289600.3290988","DOI":"10.1145\/3289600.3290988"},{"key":"54_CR17","doi-asserted-by":"publisher","unstructured":"Mackey, P., Porterfield, K., Fitzhenry, E., Choudhury, S., Chin, G.: A chronological edge-driven approach to temporal subgraph isomorphism. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 3972\u20133979 (2018). https:\/\/doi.org\/10.1109\/BigData.2018.8622100","DOI":"10.1109\/BigData.2018.8622100"},{"key":"54_CR18","doi-asserted-by":"publisher","DOI":"10.1142\/q0268","volume-title":"A Guide to Temporal Networks","author":"N Masuda","year":"2016","unstructured":"Masuda, N., Lambiotte, R.: A Guide to Temporal Networks. World Scientific, London (2016). https:\/\/doi.org\/10.1142\/q0268"},{"issue":"2","key":"54_CR19","doi-asserted-by":"publisher","first-page":"023163","DOI":"10.1103\/PhysRevResearch.2.023163","volume":"2","author":"N Masuda","year":"2020","unstructured":"Masuda, N., Holme, P.: Small inter-event times govern epidemic spreading on networks. Phys. Rev. Res. 2(2), 023163 (2020). https:\/\/doi.org\/10.1103\/PhysRevResearch.2.023163","journal-title":"Phys. Rev. Res."},{"key":"54_CR20","doi-asserted-by":"publisher","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, pp. 601\u2013610 (2017).https:\/\/doi.org\/10.1145\/3018661.3018731","DOI":"10.1145\/3018661.3018731"},{"issue":"5","key":"54_CR21","doi-asserted-by":"publisher","first-page":"052307","DOI":"10.1103\/PhysRevE.98.052307","volume":"98","author":"J Petit","year":"2018","unstructured":"Petit, J., Gueuning, M., Carletti, T., Lauwens, B., Lambiotte, R.: Random walk on temporal networks with lasting edges. Phys. Rev. E 98(5), 052307 (2018). https:\/\/doi.org\/10.1103\/PhysRevE.98.052307","journal-title":"Phys. Rev. E"},{"key":"54_CR22","doi-asserted-by":"publisher","unstructured":"Redmond, U., Cunningham, P.: Temporal subgraph isomorphism. In: Proceedings of 2013 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 1451\u20131452 (2013). https:\/\/doi.org\/10.1145\/2492517.2492586","DOI":"10.1145\/2492517.2492586"},{"key":"54_CR23","unstructured":"Redmond, U., Cunningham, P.: Subgraph isomorphism in temporal networks. arXiv preprint arXiv:1605.02174 (2016)"},{"issue":"5","key":"54_CR24","doi-asserted-by":"publisher","first-page":"052302","DOI":"10.1103\/PhysRevE.96.052302","volume":"96","author":"LE Rocha","year":"2017","unstructured":"Rocha, L.E., Masuda, N., Holme, P.: Sampling of temporal networks: methods and biases. Phys. Rev. E 96(5), 052302 (2017). https:\/\/doi.org\/10.1103\/PhysRevE.96.052302","journal-title":"Phys. Rev. E"},{"key":"54_CR25","doi-asserted-by":"publisher","unstructured":"Rossetti, G., Cazabet, R.: Community discovery in dynamic networks: a survey. ACM Comput. Surv. 51(2) (2018). https:\/\/doi.org\/10.1145\/3172867","DOI":"10.1145\/3172867"},{"key":"54_CR26","doi-asserted-by":"publisher","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 4292\u20134293 (2015). https:\/\/doi.org\/10.5555\/2888116.2888372","DOI":"10.5555\/2888116.2888372"},{"key":"54_CR27","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1109\/ACCESS.2019.2961936","volume":"8","author":"EA Singh","year":"2020","unstructured":"Singh, E.A., Cherifi, H.: Centrality-based opinion modeling on temporal networks. IEEE Access 8, 1945\u20131961 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2019.2961936","journal-title":"IEEE Access"},{"issue":"10","key":"54_CR28","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.3390\/sym11101188","volume":"11","author":"X Sun","year":"2019","unstructured":"Sun, X., Tan, Y., Wu, Q., Wang, J., Shen, C.: New algorithms for counting temporal graph pattern. Symmetry 11(10), 1188 (2019). https:\/\/doi.org\/10.3390\/sym11101188","journal-title":"Symmetry"},{"key":"54_CR29","doi-asserted-by":"publisher","first-page":"49778","DOI":"10.1109\/ACCESS.2019.2911181","volume":"7","author":"X Sun","year":"2019","unstructured":"Sun, X., Tan, Y., Wu, Q., Chen, B., Shen, C.: TM-Miner: TFS-based algorithm for mining temporal motifs in large temporal network. IEEE Access 7, 49778\u201349789 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2911181","journal-title":"IEEE Access"},{"key":"54_CR30","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2020.2980257","author":"S Sun","year":"2020","unstructured":"Sun, S., Luo, Q.: Subgraph matching with effective matching order and indexing. Trans. Knowl. Data Eng. (2020). https:\/\/doi.org\/10.1109\/TKDE.2020.2980257","journal-title":"Trans. Knowl. Data Eng."},{"issue":"6","key":"54_CR31","doi-asserted-by":"publisher","first-page":"062315","DOI":"10.1103\/PhysRevE.98.062315","volume":"98","author":"M Tizzani","year":"2018","unstructured":"Tizzani, M., Lenti, S., Ubaldi, E., Vezzani, A., Castellano, C., Burioni, R.: Epidemic spreading and aging in temporal networks with memory. Phys. Rev. E 98(6), 062315 (2018). https:\/\/doi.org\/10.1103\/PhysRevE.98.062315","journal-title":"Phys. Rev. E"},{"key":"54_CR32","doi-asserted-by":"publisher","first-page":"7164","DOI":"10.1038\/s41598-020-63221-2","volume":"10","author":"M Torricelli","year":"2020","unstructured":"Torricelli, M., Karsai, M., Gauvin, L.: weg2vec: Event embedding for temporal networks. Sci. Rep. 10, 7164 (2020). https:\/\/doi.org\/10.1038\/s41598-020-63221-2","journal-title":"Sci. Rep."},{"key":"54_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s41060-019-00189-x","volume":"9","author":"I Tsalouchidou","year":"2020","unstructured":"Tsalouchidou, I., et al.: Temporal betweenness centrality in dynamic graphs. Int. J. Data Sci. Anal. 9, 257\u2013272 (2020). https:\/\/doi.org\/10.1007\/s41060-019-00189-x","journal-title":"Int. J. Data Sci. Anal."},{"issue":"4","key":"54_CR34","doi-asserted-by":"publisher","first-page":"043028","DOI":"10.1088\/1367-2630\/ab13fb","volume":"21","author":"OE Williams","year":"2019","unstructured":"Williams, O.E., Lillo, F., Latora, V.: Effects of memory on spreading processes in non-Markovian temporal networks. New J. Phys. 21(4), 043028 (2019). https:\/\/doi.org\/10.1088\/1367-2630\/ab13fb","journal-title":"New J. Phys."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications IX"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65351-4_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,4]],"date-time":"2021-01-04T22:52:26Z","timestamp":1609800746000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-65351-4_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030653507","9783030653514"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65351-4_54","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"5 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2020","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}