{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:16:13Z","timestamp":1726060573568},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030366827"},{"type":"electronic","value":"9783030366834"}],"license":[{"start":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T00:00:00Z","timestamp":1574640000000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-36683-4_38","type":"book-chapter","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T17:08:15Z","timestamp":1574788095000},"page":"469-480","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Comparing Temporal Graphs Using Dynamic Time Warping"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Froese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brijnesh","family":"Jain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malte","family":"Renken","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,25]]},"reference":[{"issue":"2","key":"38_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/s10618-018-0596-4","volume":"33","author":"A Abanda","year":"2019","unstructured":"Abanda, A., Mori, U., Lozano, J.A.: A review on distance based time series classification. Data Min. Knowl. Disc. 33(2), 378\u2013412 (2019)","journal-title":"Data Min. Knowl. Disc."},{"key":"38_CR2","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Upper Saddle River (1993)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Bagavathi, A., Krishnan, S.: Multi-Net: a scalable multiplex network embedding framework. In: Complex Networks and Their Applications VII. SCI, vol. 813, pp. 119\u2013131. Springer (2019)","DOI":"10.1007\/978-3-030-05414-4_10"},{"issue":"2","key":"38_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/cplx.20156","volume":"12","author":"D Braha","year":"2006","unstructured":"Braha, D., Bar-Yam, Y.: From centrality to temporary fame: dynamic centrality in complex networks. Complexity 12(2), 59\u201363 (2006)","journal-title":"Complexity"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"Elhesha, R., Sarkar, A., Boucher, C., Kahveci, T.: Identification of co-evolving temporal networks. In: Proceedings of BCB 2018, pp. 591\u2013592. ACM (2018)","DOI":"10.1145\/3233547.3233686"},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"Fr\u00f6hlich, H., Wegner, J.K., Sieker, F., Zell, A.: Optimal assignment kernels for attributed molecular graphs. In: Proceedings of ICML 2005, pp. 225\u2013232. ACM (2005)","DOI":"10.1145\/1102351.1102380"},{"issue":"1","key":"38_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1140\/epjds\/s13688-018-0140-1","volume":"7","author":"M G\u00e9nois","year":"2018","unstructured":"G\u00e9nois, M., Barrat, A.: Can co-location be used as a proxy for face-to-face contacts? EPJ Data Sci. 7(1), 11 (2018)","journal-title":"EPJ Data Sci."},{"key":"38_CR8","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/j.cosrev.2017.11.002","volume":"27","author":"S Ghosh","year":"2018","unstructured":"Ghosh, S., Das, N., Gon\u00e7alves, T., Quaresma, P., Kundu, M.: The journey of graph kernels through two decades. Comput. Sci. Rev. 27, 88\u2013111 (2018)","journal-title":"Comput. Sci. Rev."},{"issue":"3","key":"38_CR9","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., Saram\u00e4ki, J.: Temporal networks. Phys. Rep. 519(3), 97\u2013125 (2012)","journal-title":"Phys. Rep."},{"issue":"2","key":"38_CR10","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.dam.2016.06.027","volume":"214","author":"BJ Jain","year":"2016","unstructured":"Jain, B.J.: On the geometry of graph spaces. Discrete Appl. Math. 214, 126\u2013144 (2016)","journal-title":"Discrete Appl. Math."},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"Jouili, S., Tabbone, S.: Graph matching based on node signatures. In: Proceedings of GbRPR 2009. LNCS, vol. 5534, pp. 154\u2013163. Springer (2009)","DOI":"10.1007\/978-3-642-02124-4_16"},{"issue":"6","key":"38_CR13","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.physa.2008.11.021","volume":"388","author":"V Kostakos","year":"2009","unstructured":"Kostakos, V.: Temporal graphs. Phys. A 388(6), 1007\u20131023 (2009)","journal-title":"Phys. A"},{"issue":"6366","key":"38_CR14","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1126\/science.aai7488","volume":"358","author":"A Li","year":"2017","unstructured":"Li, A., Cornelius, S.P., Liu, Y.Y., Wang, L., Barab\u00e1si, A.L.: The fundamental advantages of temporal networks. Science 358(6366), 1042\u20131046 (2017)","journal-title":"Science"},{"key":"38_CR15","doi-asserted-by":"crossref","unstructured":"Riesen, K.: Structural pattern recognition with graph edit distance. Springer (2015)","DOI":"10.1007\/978-3-319-27252-8"},{"issue":"1","key":"38_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech 26(1), 43\u201349 (1978)","journal-title":"IEEE Trans. Acoust. Speech"},{"issue":"14","key":"38_CR17","doi-asserted-by":"publisher","first-page":"i180","DOI":"10.1093\/bioinformatics\/btx246","volume":"33","author":"V Vijayan","year":"2017","unstructured":"Vijayan, V., Critchlow, D., Milenkovi\u0107, T.: Alignment of dynamic networks. Bioinformatics 33(14), i180\u2013i189 (2017)","journal-title":"Bioinformatics"},{"key":"38_CR18","doi-asserted-by":"crossref","unstructured":"Zuo, Y., Liu, G., Lin, H., Guo, J., Hu, X., Wu, J.: Embedding temporal network via neighborhood formation. In: Proceedings of KDD 2018, pp. 2857\u20132866. ACM (2018)","DOI":"10.1145\/3219819.3220054"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications VIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36683-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T17:14:17Z","timestamp":1574788457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36683-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,25]]},"ISBN":["9783030366827","9783030366834"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36683-4_38","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,11,25]]},"assertion":[{"value":"25 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2019","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"}}]}}