{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,21]],"date-time":"2026-07-21T03:08:13Z","timestamp":1784603293063,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:00:00Z","timestamp":1531958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"AUFF","award":["28209"],"award-info":[{"award-number":["28209"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,19]]},"DOI":"10.1145\/3219819.3219991","type":"proceedings-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T13:05:12Z","timestamp":1532005512000},"page":"2347-2356","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":101,"title":["NetLSD"],"prefix":"10.1145","author":[{"given":"Anton","family":"Tsitsulin","sequence":"first","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Davide","family":"Mottin","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Bronstein","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"M\u00fcller","sequence":"additional","affiliation":[{"name":"Hasso Plattner Institute, Potsdam, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_40"},{"key":"e_1_3_2_2_2_1","volume-title":"The wave kernel signature: A quantum mechanical approach to shape analysis ICCV Workshops","author":"Aubry Mathieu","unstructured":"Mathieu Aubry , Ulrich Schlickewei , and Daniel Cremers . 2011. The wave kernel signature: A quantum mechanical approach to shape analysis ICCV Workshops . IEEE , 1626--1633. Mathieu Aubry, Ulrich Schlickewei, and Daniel Cremers . 2011. The wave kernel signature: A quantum mechanical approach to shape analysis ICCV Workshops. IEEE, 1626--1633."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Mikhail Belkin and Partha Niyogi . 2007. Convergence of Laplacian eigenmaps. In NIPS. 129--136. Mikhail Belkin and Partha Niyogi . 2007. Convergence of Laplacian eigenmaps. In NIPS. 129--136.","DOI":"10.7551\/mitpress\/7503.003.0021"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Jose Bento and Stratis Ioannidis . 2018. A Family of Tractable Graph Distances. In SDM. Jose Bento and Stratis Ioannidis . 2018. A Family of Tractable Graph Distances. In SDM.","DOI":"10.1137\/1.9781611975321.38"},{"key":"e_1_3_2_2_5_1","volume-title":"A panoramic view of Riemannian geometry","author":"Marcel Berger","unstructured":"Marcel Berger . 2012. A panoramic view of Riemannian geometry . Springer Science & Business Media . Marcel Berger . 2012. A panoramic view of Riemannian geometry. Springer Science & Business Media."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492517.2492582"},{"key":"e_1_3_2_2_7_1","volume-title":"Efficient Comparison of Massive Graphs Through The Use Of Graph Fingerprints Twelfth Workshop on Mining and Learning with Graphs (MLG) Workshop at KDD'16","author":"Bonner Stephen","year":"2016","unstructured":"Stephen Bonner , John Brennan , Ibad Kureshi , G Theodoropoulos , and AS McGough . 2016 . Efficient Comparison of Massive Graphs Through The Use Of Graph Fingerprints Twelfth Workshop on Mining and Learning with Graphs (MLG) Workshop at KDD'16 . Stephen Bonner, John Brennan, Ibad Kureshi, G Theodoropoulos, and AS McGough . 2016. Efficient Comparison of Massive Graphs Through The Use Of Graph Fingerprints Twelfth Workshop on Mining and Learning with Graphs (MLG) Workshop at KDD'16."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1899404.1899405"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1237762.1237774"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.210"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0708838104"},{"key":"e_1_3_2_2_13_1","unstructured":"Fan RK Chung . 1997. Spectral graph theory. Number 92. American Mathematical Soc. Fan RK Chung . 1997. Spectral graph theory. Number 92. American Mathematical Soc."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.015"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.45"},{"key":"e_1_3_2_2_16_1","volume-title":"Computers and intractability","author":"Garey Michael R","unstructured":"Michael R Garey and David S Johnson . 2002. Computers and intractability . Vol. Vol. 29 . wh freeman New York . Michael R Garey and David S Johnson . 2002. Computers and intractability. Vol. Vol. 29. wh freeman New York."},{"key":"e_1_3_2_2_17_1","volume-title":"On graph kernels: Hardness results and efficient alternatives. Learning Theory and Kernel Machines","author":"Thomas","unstructured":"Thomas G\"artner, Peter Flach , and Stefan Wrobel . 2003. On graph kernels: Hardness results and efficient alternatives. Learning Theory and Kernel Machines . Springer , 129--143. Thomas G\"artner, Peter Flach, and Stefan Wrobel . 2003. On graph kernels: Hardness results and efficient alternatives. Learning Theory and Kernel Machines. Springer, 129--143."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","unstructured":"Karam Gouda and Mosab Hassaan . 2016. CSI_GED: An efficient approach for graph edit similarity computation ICDE. 265--276. Karam Gouda and Mosab Hassaan . 2016. CSI_GED: An efficient approach for graph edit similarity computation ICDE. 265--276.","DOI":"10.1109\/ICDE.2016.7498246"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089014.1089019"},{"key":"e_1_3_2_2_20_1","volume-title":"Can one hear the shape of a drum? The american mathematical monthly","author":"Mark Kac","year":"1966","unstructured":"Mark Kac . 1966. Can one hear the shape of a drum? The american mathematical monthly Vol. 73 , 4 ( 1966 ), 1--23. Mark Kac . 1966. Can one hear the shape of a drum? The american mathematical monthly Vol. 73, 4 (1966), 1--23."},{"key":"e_1_3_2_2_21_1","volume-title":"Stochastic blockmodels and community structure in networks. Physical review E","author":"Karrer Brian","year":"2011","unstructured":"Brian Karrer and Mark EJ Newman . 2011. Stochastic blockmodels and community structure in networks. Physical review E Vol. 83 ( 2011 ). Brian Karrer and Mark EJ Newman . 2011. Stochastic blockmodels and community structure in networks. Physical review E Vol. 83 (2011)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020607"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623706"},{"key":"e_1_3_2_2_24_1","unstructured":"Risi Kondor and Horace Pan . 2016. The multiscale laplacian graph kernel. In NIPS. 2990--2998. Risi Kondor and Horace Pan . 2016. The multiscale laplacian graph kernel. In NIPS. 2990--2998."},{"key":"e_1_3_2_2_25_1","volume-title":"Deltacon: A principled massive-graph similarity function SDM. 162--170.","author":"Koutra Danai","year":"2013","unstructured":"Danai Koutra , Joshua T Vogelstein , and Christos Faloutsos . 2013 . Deltacon: A principled massive-graph similarity function SDM. 162--170. Danai Koutra, Joshua T Vogelstein, and Christos Faloutsos . 2013. Deltacon: A principled massive-graph similarity function SDM. 162--170."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Yongjiang Liang and Peixiang Zhao . 2017. Similarity Search in Graph Databases: A Multi-Layered Indexing Approach ICDE. 783--794. Yongjiang Liang and Peixiang Zhao . 2017. Similarity Search in Graph Databases: A Multi-Layered Indexing Approach ICDE. 783--794.","DOI":"10.1109\/ICDE.2017.129"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Chih-Long Lin . 1994. Hardness of Approximating Graph Transformation Problem ISAAC. 74--82. Chih-Long Lin . 1994. Hardness of Approximating Graph Transformation Problem ISAAC. 74--82.","DOI":"10.1007\/3-540-58325-4_168"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.148"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.09.005"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115504.3115930"},{"key":"e_1_3_2_2_31_1","series-title":"SIAM review","volume-title":"Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later","author":"Moler Cleve","year":"2003","unstructured":"Cleve Moler and Charles Van Loan . 2003. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later . SIAM review , Vol. 45 , 1 ( 2003 ), 3--49. Cleve Moler and Charles Van Loan . 2003. Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later. SIAM review, Vol. 45, 1 (2003), 3--49."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Giannis Nikolentzos Polykarpos Meladianos and Michalis Vazirgiannis . 2017. Matching Node Embeddings for Graph Similarity.. In AAAI. 2429--2435. Giannis Nikolentzos Polykarpos Meladianos and Michalis Vazirgiannis . 2017. Matching Node Embeddings for Graph Similarity.. In AAAI. 2429--2435.","DOI":"10.1609\/aaai.v31i1.10839"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/571647.571648"},{"key":"e_1_3_2_2_34_1","volume-title":"Web graph similarity for anomaly detection. Journal of Internet Services and Applications","author":"Papadimitriou Panagiotis","year":"2010","unstructured":"Panagiotis Papadimitriou , Ali Dasdan , and Hector Garcia-Molina . 2010. Web graph similarity for anomaly detection. Journal of Internet Services and Applications ( 2010 ), 19--30. Panagiotis Papadimitriou, Ali Dasdan, and Hector Garcia-Molina . 2010. Web graph similarity for anomaly detection. Journal of Internet Services and Applications (2010), 19--30."},{"key":"e_1_3_2_2_35_1","volume-title":"The graph-tool python library. figshare","author":"Peixoto Tiago P.","year":"2014","unstructured":"Tiago P. Peixoto . 2014. The graph-tool python library. figshare ( 2014 ). Tiago P. Peixoto . 2014. The graph-tool python library. figshare (2014)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098061"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313167"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078187"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_2_41_1","volume-title":"A concise and provably informative multi-scale signature based on heat diffusion Computer graphics forum","author":"Sun Jian","unstructured":"Jian Sun , Maks Ovsjanikov , and Leonidas Guibas . 2009. A concise and provably informative multi-scale signature based on heat diffusion Computer graphics forum , Vol. Vol. 28 . Wiley Online Library , 1383--1392. Jian Sun, Maks Ovsjanikov, and Leonidas Guibas . 2009. A concise and provably informative multi-scale signature based on heat diffusion Computer graphics forum, Vol. Vol. 28. Wiley Online Library, 1383--1392."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559905"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186120"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778858"},{"key":"e_1_3_2_2_45_1","unstructured":"Saurabh Verma and Zhi-Li Zhang . 2017. Hunt For The Unique Stable Sparse And Fast Feature Learning On Graphs NIPS. 87--97. Saurabh Verma and Zhi-Li Zhang . 2017. Hunt For The Unique Stable Sparse And Fast Feature Learning On Graphs NIPS. 87--97."},{"key":"e_1_3_2_2_46_1","volume-title":"Consistency of spectral clustering. The Annals of Statistics","author":"Luxburg Ulrike Von","year":"2008","unstructured":"Ulrike Von Luxburg , Mikhail Belkin , and Olivier Bousquet . 2008. Consistency of spectral clustering. The Annals of Statistics ( 2008 ), 555--586. Ulrike Von Luxburg, Mikhail Belkin, and Olivier Bousquet . 2008. Consistency of spectral clustering. The Annals of Statistics (2008), 555--586."},{"key":"e_1_3_2_2_47_1","volume-title":"Hitting and commute times in large graphs are often misleading. arXiv preprint arXiv:1003.1266","author":"Luxburg Ulrike Von","year":"2010","unstructured":"Ulrike Von Luxburg , Agnes Radl , and Matthias Hein . 2010. Hitting and commute times in large graphs are often misleading. arXiv preprint arXiv:1003.1266 ( 2010 ). Ulrike Von Luxburg, Agnes Radl, and Matthias Hein . 2010. Hitting and commute times in large graphs are often misleading. arXiv preprint arXiv:1003.1266 (2010)."},{"key":"e_1_3_2_2_48_1","volume-title":"Mathematisch-Physikalische Klasse","author":"Hermann Weyl","year":"1911","unstructured":"Hermann Weyl . 1911. \u00dcber die asymptotische Verteilung der Eigenwerte. Nachrichten von der Gesellschaft der Wissenschaften zu G\u00f6ttingen , Mathematisch-Physikalische Klasse ( 1911 ), 110--117. Hermann Weyl . 1911. \u00dcber die asymptotische Verteilung der Eigenwerte. Nachrichten von der Gesellschaft der Wissenschaften zu G\u00f6ttingen, Mathematisch-Physikalische Klasse (1911), 110--117."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.03.011"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-014-0373-y"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2349924"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247650"}],"event":{"name":"KDD '18: The 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"London United Kingdom","acronym":"KDD '18","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3219991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3219819.3219991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:22Z","timestamp":1750212442000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3219819.3219991"}},"subtitle":["Hearing the Shape of a Graph"],"short-title":[],"issued":{"date-parts":[[2018,7,19]]},"references-count":54,"alternative-id":["10.1145\/3219819.3219991","10.1145\/3219819"],"URL":"https:\/\/doi.org\/10.1145\/3219819.3219991","relation":{},"subject":[],"published":{"date-parts":[[2018,7,19]]},"assertion":[{"value":"2018-07-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}