{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T03:44:53Z","timestamp":1772855093208,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467257","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:12:09Z","timestamp":1628748729000},"page":"185-195","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Graph Similarity Description"],"prefix":"10.1145","author":[{"given":"Corinna","family":"Coupette","sequence":"first","affiliation":[{"name":"Max Planck Institute for Informatics, Saarbruecken, Germany"}]},{"given":"Jilles","family":"Vreeken","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbruecken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Applied Network Science","volume":"4","author":"Bagrow J. P.","year":"2019","unstructured":"J. P. Bagrow and E. M. Bollt . 2019. An information-theoretic, all-scales approach to comparing networks . Applied Network Science , Vol. 4 , 1 ( 2019 ), 45:1--45:15. J. P. Bagrow and E. M. Bollt. 2019. An information-theoretic, all-scales approach to comparing networks. Applied Network Science, Vol. 4, 1 (2019), 45:1--45:15."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"M. Berlingerio D. Koutra T. Eliassi-Rad and C. Faloutsos. 2013. Network similarity via multiple social theories. ASONAM. ACM 1439--1440.  M. Berlingerio D. Koutra T. Eliassi-Rad and C. Faloutsos. 2013. Network similarity via multiple social theories. ASONAM. ACM 1439--1440.","DOI":"10.1145\/2492517.2492582"},{"key":"e_1_3_2_2_3_1","volume-title":"Shortest-path kernels on graphs","author":"Borgwardt K. M.","unstructured":"K. M. Borgwardt and H.-P. Kriegel . 2005. Shortest-path kernels on graphs . In ICDM. IEEE , 8 pp. K. M. Borgwardt and H.-P. Kriegel. 2005. Shortest-path kernels on graphs. In ICDM. IEEE, 8 pp."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1618595.1618605"},{"key":"e_1_3_2_2_5_1","volume-title":"Version 18 (2020\/11\/22).","author":"Cornell University","year":"2020","unstructured":"Cornell University . 2020. arXiv Dataset , Version 18 (2020\/11\/22). ( 2020 ). https:\/\/www.kaggle.com\/Cornell-University\/arxiv Cornell University. 2020. arXiv Dataset, Version 18 (2020\/11\/22). (2020). https:\/\/www.kaggle.com\/Cornell-University\/arxiv"},{"key":"#cr-split#-e_1_3_2_2_6_1.1","doi-asserted-by":"crossref","unstructured":"C. Coupette J. Beckedorf D. Hartung M. Bommarito and D. M. Katz. 2021. Measuring Law Over Time. Frontiers in Physics (2021). http:\/\/dx.doi.org\/10.3389\/fphy.2021.658463 10.3389\/fphy.2021.658463","DOI":"10.3389\/fphy.2021.658463"},{"key":"#cr-split#-e_1_3_2_2_6_1.2","doi-asserted-by":"crossref","unstructured":"C. Coupette J. Beckedorf D. Hartung M. Bommarito and D. M. Katz. 2021. Measuring Law Over Time. Frontiers in Physics (2021). http:\/\/dx.doi.org\/10.3389\/fphy.2021.658463","DOI":"10.3389\/fphy.2021.658463"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-010-0209-3"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"J. Feng X. He N. Hubig C. B\u00f6hm and C. Plant. 2013. Compression-based graph mining exploiting structure primitives. In ICDM. IEEE 181--190.  J. Feng X. He N. Hubig C. B\u00f6hm and C. Plant. 2013. Compression-based graph mining exploiting structure primitives. In ICDM. IEEE 181--190.","DOI":"10.1109\/ICDM.2013.56"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"S. Goebl A. Tonch C. B\u00f6hm and C. Plant. 2016. MeGS: Partitioning meaningful subgraph structures using minimum description length. In ICDM. IEEE 889--894.  S. Goebl A. Tonch C. B\u00f6hm and C. Plant. 2016. MeGS: Partitioning meaningful subgraph structures using minimum description length. In ICDM. IEEE 889--894.","DOI":"10.1109\/ICDM.2016.0108"},{"key":"e_1_3_2_2_10_1","volume-title":"The Minimum Description Length Principle","author":"Gr\u00fcnwald P.","unstructured":"P. Gr\u00fcnwald . 2007. The Minimum Description Length Principle . MIT Press . P. Gr\u00fcnwald. 2007. The Minimum Description Length Principle .MIT Press."},{"key":"e_1_3_2_2_11_1","volume-title":"Graph distances and similarity. Topics in Combinatorics and Graph Theory","author":"Kaden F.","unstructured":"F. Kaden . 1990. Graph distances and similarity. Topics in Combinatorics and Graph Theory . Springer , 397--404. F. Kaden. 1990. Graph distances and similarity. Topics in Combinatorics and Graph Theory. Springer, 397--404."},{"key":"e_1_3_2_2_12_1","first-page":"1","article-title":"Online summarization of dynamic graphs using subjective interestingness for sequential data","volume":"35","author":"Kapoor S.","year":"2020","unstructured":"S. Kapoor , D. K. Saxena , and M. van Leeuwen . 2020 . Online summarization of dynamic graphs using subjective interestingness for sequential data . Data Min. Knowl. Disc. , Vol. 35 , 1 (2020), 1 -- 39 . S. Kapoor, D. K. Saxena, and M. van Leeuwen. 2020. Online summarization of dynamic graphs using subjective interestingness for sequential data. Data Min. Knowl. Disc., Vol. 35, 1 (2020), 1--39.","journal-title":"Data Min. Knowl. Disc."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11267"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2824443"},{"key":"e_1_3_2_2_15_1","volume-title":"ACM TKDD","volume":"1","author":"Leskovec J.","year":"2007","unstructured":"J. Leskovec , J. Kleinberg , and C. Faloutsos . 2007. Graph evolution: Densification and shrinking diameters . ACM TKDD , Vol. 1 , 1 ( 2007 ), 2:1--2:41. J. Leskovec, J. Kleinberg, and C. Faloutsos. 2007. Graph evolution: Densification and shrinking diameters. ACM TKDD, Vol. 1, 1 (2007), 2:1--2:41."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838101"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"M. Li and P. Vit\u00e1nyi. 1993. An Introduction to Kolmogorov Complexity and its Applications. Springer.  M. Li and P. Vit\u00e1nyi. 1993. An Introduction to Kolmogorov Complexity and its Applications. Springer.","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"e_1_3_2_2_18_1","first-page":"3077","article-title":"SlashBurn: Graph compression and mining beyond caveman communities","volume":"26","author":"Lim Y.","year":"2014","unstructured":"Y. Lim , U. Kang , and C. Faloutsos . 2014 . SlashBurn: Graph compression and mining beyond caveman communities . IEEE TKDE , Vol. 26 , 12 (2014), 3077 -- 3089 . Y. Lim, U. Kang, and C. Faloutsos. 2014. SlashBurn: Graph compression and mining beyond caveman communities. IEEE TKDE, Vol. 26, 12 (2014), 3077--3089.","journal-title":"IEEE TKDE"},{"key":"e_1_3_2_2_19_1","unstructured":"G. Ma N. K. Ahmed T. L. Willke and P. S. Yu. 2019. Deep Graph Similarity Learning: A Survey. (2019). arxiv: cs.LG\/1912.11615  G. Ma N. K. Ahmed T. L. Willke and P. S. Yu. 2019. Deep Graph Similarity Learning: A Survey. (2019). arxiv: cs.LG\/1912.11615"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"G. Nikolentzos P. Meladianos S. Limnios and M. Vazirgiannis. 2018. A Degeneracy Framework for Graph Similarity. In IJCAI. 2595--2601.  G. Nikolentzos P. Meladianos S. Limnios and M. Vazirgiannis. 2018. A Degeneracy Framework for Graph Similarity. In IJCAI. 2595--2601.","DOI":"10.24963\/ijcai.2018\/360"},{"key":"e_1_3_2_2_21_1","volume-title":"NeurIPS","volume":"34","author":"Ok S.","year":"2020","unstructured":"S. Ok . 2020 . A graph similarity for deep learning . In NeurIPS , Vol. 34 . S. Ok. 2020. A graph similarity for deep learning. In NeurIPS, Vol. 34."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/45.6.631"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346150"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783321"},{"key":"e_1_3_2_2_25_1","unstructured":"N. Shervashidze S. Vishwanathan T. Petri K. Mehlhorn and K. Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In Artificial Intelligence and Statistics. 488--495.  N. Shervashidze S. Vishwanathan T. Petri K. Mehlhorn and K. Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In Artificial Intelligence and Statistics. 488--495."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"J. Sun C. Faloutsos S. Papadimitriou and P. S. Yu. 2007. GraphScope: parameter-free mining of large time-evolving graphs. In KDD. 687--696.  J. Sun C. Faloutsos S. Papadimitriou and P. S. Yu. 2007. GraphScope: parameter-free mining of large time-evolving graphs. In KDD. 687--696.","DOI":"10.1145\/1281192.1281266"},{"key":"e_1_3_2_2_27_1","unstructured":"M. Togninalli E. Ghisu F. Llinares-L\u00f3pez B. Rieck and K. Borgwardt. 2019. Wasserstein weisfeiler-lehman graph kernels. In NeurIPS. 6439--6449.  M. Togninalli E. Ghisu F. Llinares-L\u00f3pez B. Rieck and K. Borgwardt. 2019. Wasserstein weisfeiler-lehman graph kernels. In NeurIPS. 6439--6449."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"P. Yanardag and S. Vishwanathan. 2015. Deep graph kernels. In KDD. ACM 1365--1374.  P. Yanardag and S. Vishwanathan. 2015. Deep graph kernels. In KDD. ACM 1365--1374.","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx252"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","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 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467257","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467257","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:28Z","timestamp":1750191508000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467257"}},"subtitle":["How Are These Graphs Similar?"],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":31,"alternative-id":["10.1145\/3447548.3467257","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467257","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}