{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:01Z","timestamp":1750220581623,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T00:00:00Z","timestamp":1597881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Bundesministerium f\u00fcr Bildung und Forschung","award":["01|S18038C"],"award-info":[{"award-number":["01|S18038C"]}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["EXC 2070 -- 390732324"],"award-info":[{"award-number":["EXC 2070 -- 390732324"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,23]]},"DOI":"10.1145\/3394486.3403180","type":"proceedings-article","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:15:22Z","timestamp":1597965322000},"page":"1275-1284","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["HOPS: Probabilistic Subtree Mining for Small and Large Graphs"],"prefix":"10.1145","author":[{"given":"Pascal","family":"Welke","sequence":"first","affiliation":[{"name":"University of Bonn, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Seiffarth","sequence":"additional","affiliation":[{"name":"University of Bonn, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kamp","sequence":"additional","affiliation":[{"name":"Monash University, Melbourne, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[{"name":"University of Bonn and Fraunhofer IAIS, Bonn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,20]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.14778\/3342263.3342640"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_2_1","DOI":"10.1109\/tkde.2005.127"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_3_1","DOI":"10.1017\/S0963548314000339"},{"key":"e_1_3_2_2_4_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S . Johnson . 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman . Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman."},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.1007\/s10618-006-0059-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1016\/j.tcs.2010.03.030"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_7_1","DOI":"10.1145\/1008731.1008738"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_8_1","DOI":"10.1007\/s10618-013-0321-2"},{"unstructured":"Donald E. Knuth. 1998. The art of computer programming volume 2: (2nd ed.) seminumerical algorithms .Addison Wesley Longman Publishing Co. Inc. Redwood City CA USA.  Donald E. Knuth. 1998. The art of computer programming volume 2: (2nd ed.) seminumerical algorithms .Addison Wesley Longman Publishing Co. Inc. Redwood City CA USA.","key":"e_1_3_2_2_9_1"},{"key":"e_1_3_2_2_10_1","volume-title":"Languages and Programming (ICALP) Proceedings, Part I (Lecture Notes in Computer Science","volume":"664","author":"Koutis Ioannis","year":"2009","unstructured":"Ioannis Koutis and Ryan Williams . 2009 . Limits and Applications of Group Algebras for Parameterized Problems. In International Colloquium on Automata , Languages and Programming (ICALP) Proceedings, Part I (Lecture Notes in Computer Science , Vol. 5555). Springer, 653-- 664 . https:\/\/doi.org\/10.1007\/978--3--642-02927--1_54 10.1007\/978--3--642-02927--1_54 Ioannis Koutis and Ryan Williams. 2009. Limits and Applications of Group Algebras for Parameterized Problems. In International Colloquium on Automata, Languages and Programming (ICALP) Proceedings, Part I (Lecture Notes in Computer Science, Vol. 5555). Springer, 653--664. https:\/\/doi.org\/10.1007\/978--3--642-02927--1_54"},{"unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data .  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data .","key":"e_1_3_2_2_11_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_12_1","DOI":"10.1145\/2898361"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_13_1","DOI":"10.1145\/3292500.3330995"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_14_1","DOI":"10.1007\/s10618-018-0553-2"},{"key":"e_1_3_2_2_15_1","volume-title":"A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets. CoRR","author":"Ribeiro Pedro","year":"2019","unstructured":"Pedro Ribeiro , Pedro Paredes , Miguel E. P. Silva , David Aparicio , and Fernando Silva . 2019. A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets. CoRR , Vol. abs\/ 1910 .13011 ( 2019 ), 1--35. arxiv: 1910.13011 http:\/\/arxiv.org\/abs\/1910.13011 Pedro Ribeiro, Pedro Paredes, Miguel E. P. Silva, David Aparicio, and Fernando Silva. 2019. A Survey on Subgraph Counting: Concepts, Algorithms and Applications to Network Motifs and Graphlets. CoRR, Vol. abs\/1910.13011 (2019), 1--35. arxiv: 1910.13011 http:\/\/arxiv.org\/abs\/1910.13011"},{"key":"e_1_3_2_2_16_1","volume-title":"Pascal Welke, and Stefan Wrobel.","author":"Schulz Till Hendrik","year":"2018","unstructured":"Till Hendrik Schulz , Tam\u00e1 s Horv\u00e1 th , Pascal Welke, and Stefan Wrobel. 2018 . Mining Tree Patterns with Partially Injective Homomorphisms. In European Conference on Machine Learning and Knowledge Discovery in Databases ECML PKDD Proceedings, Part II (Lecture Notes in Computer Science , Vol. 11052). Springer, 585-- 601 . https:\/\/doi.org\/10.1007\/978--3-030--10928--8_35 10.1007\/978--3-030--10928--8_35 Till Hendrik Schulz, Tam\u00e1 s Horv\u00e1 th, Pascal Welke, and Stefan Wrobel. 2018. Mining Tree Patterns with Partially Injective Homomorphisms. In European Conference on Machine Learning and Knowledge Discovery in Databases ECML PKDD Proceedings, Part II (Lecture Notes in Computer Science, Vol. 11052). Springer, 585--601. https:\/\/doi.org\/10.1007\/978--3-030--10928--8_35"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_17_1","DOI":"10.1145\/321921.321925"},{"key":"e_1_3_2_2_18_1","volume-title":"Maximum and Maximal Matchings in Bipartite Graphs. In International Symposium on Algorithms and Computation (ISAAC) Proceedings (Lecture Notes in Computer Science","volume":"101","author":"Uno Takeaki","year":"1997","unstructured":"Takeaki Uno . 1997 . Algorithms for Enumerating All Perfect , Maximum and Maximal Matchings in Bipartite Graphs. In International Symposium on Algorithms and Computation (ISAAC) Proceedings (Lecture Notes in Computer Science , Vol. 1350). Springer, 92-- 101 . https:\/\/doi.org\/10.1007\/3--540--63890--3_11 10.1007\/3--540--63890--3_11 Takeaki Uno. 1997. Algorithms for Enumerating All Perfect, Maximum and Maximal Matchings in Bipartite Graphs. In International Symposium on Algorithms and Computation (ISAAC) Proceedings (Lecture Notes in Computer Science, Vol. 1350). Springer, 92--101. https:\/\/doi.org\/10.1007\/3--540--63890--3_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_19_1","DOI":"10.1007\/s10994-017-5688-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_20_1","DOI":"10.1007\/s10994-019-05779-1"}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '20","name":"KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event CA USA"},"container-title":["Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403180","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3394486.3403180","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:34Z","timestamp":1750195894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3394486.3403180"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,20]]},"references-count":20,"alternative-id":["10.1145\/3394486.3403180","10.1145\/3394486"],"URL":"https:\/\/doi.org\/10.1145\/3394486.3403180","relation":{},"subject":[],"published":{"date-parts":[[2020,8,20]]},"assertion":[{"value":"2020-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}