{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:43:34Z","timestamp":1725950614463},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319731971"},{"type":"electronic","value":"9783319731988"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-73198-8_3","type":"book-chapter","created":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T11:23:45Z","timestamp":1518607425000},"page":"27-40","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast Streaming Small Graph Canonization"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Paredes","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Arvind, V., Das, B., K\u00f6bler, J.: The space complexity of k-tree isomorphism. In: International Symposium on Algorithms and Computation, pp. 822\u2013833. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-77120-3_71"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: 48th Annual ACM SIGACT Symposium on Theory of Computing, pp. 684\u2013697. ACM (2016)","DOI":"10.1145\/2897518.2897542"},{"issue":"5439","key":"3_CR3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"1","key":"3_CR4","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5(1), 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"issue":"3","key":"3_CR5","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM (JACM) 38(3), 690\u2013728 (1991)","journal-title":"J. ACM (JACM)"},{"issue":"7","key":"3_CR6","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1109\/TPAMI.2005.138","volume":"27","author":"M Gori","year":"2005","unstructured":"Gori, M., Maggini, M., Sarti, L.: Exact and approximate graph matching using random walks. IEEE Trans. Pattern Anal. Mach. Intell. 27(7), 1100\u20131111 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"12","key":"3_CR7","doi-asserted-by":"crossref","first-page":"3374","DOI":"10.1109\/TKDE.2015.2453956","volume":"27","author":"H Huang","year":"2015","unstructured":"Huang, H., Tang, J., Liu, L., Luo, J., Fu, X.: Triadic closure pattern analysis and prediction in social networks. IEEE Trans. Knowl. Data Eng. 27(12), 3374\u20133389 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"3_CR8","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, J.F., Van den Broeck, W.: What\u2019s in a crowd? analysis of face-to-face behavioral networks. J. Theor. Biol. 271(1), 166\u2013180 (2011)","journal-title":"J. Theor. Biol."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Junttila, T., Kaski, P.: Engineering an efficient canonical labeling tool for large and sparse graphs. In: 9th Workshop on Algorithm Engineering and Experiments, pp. 135\u2013149 (2007)","DOI":"10.1137\/1.9781611972870.13"},{"issue":"11","key":"3_CR10","doi-asserted-by":"crossref","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., Saram\u00e4ki, J.: Temporal motifs in time-dependent networks. J. Stat. Mech. Theory Exp. 2011(11), P11005 (2011)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"9","key":"3_CR11","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi, M., Karypis, G.: An efficient algorithm for discovering frequent subgraphs. IEEE Trans. Knowl. Data Eng. 16(9), 1038\u20131051 (2004)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR12","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"issue":"1","key":"3_CR13","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"McGregor, A.: Graph stream algorithms: a survey. ACM SIGMOD Rec. 43(1), 9\u201320 (2014)","journal-title":"ACM SIGMOD Rec."},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, ii. J. Symb. Comput. 60, 94\u2013112 (2014)","journal-title":"J. Symb. Comput."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Paranjape, A., Benson, A.R., Leskovec, J.: Motifs in temporal networks. In: 10th ACM International Conference on Web Search and Data Mining, pp. 601\u2013610. ACM (2017)","DOI":"10.1145\/3018661.3018731"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Wernicke, S.: Efficient detection of network motifs. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3(4) (2006)","DOI":"10.1109\/TCBB.2006.51"}],"container-title":["Springer Proceedings in Complexity","Complex Networks IX"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73198-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,10]],"date-time":"2019-10-10T20:01:12Z","timestamp":1570737672000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73198-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319731971","9783319731988"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73198-8_3","relation":{},"ISSN":["2213-8684","2213-8692"],"issn-type":[{"type":"print","value":"2213-8684"},{"type":"electronic","value":"2213-8692"}],"subject":[],"published":{"date-parts":[[2018]]}}}