{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:03Z","timestamp":1750306083981,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"TUBITAK","award":["TUBITAK-2219"],"award-info":[{"award-number":["TUBITAK-2219"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087601","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"133-136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Brief Announcement"],"prefix":"10.1145","author":[{"given":"Soheil","family":"Behnezhad","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Mahsa","family":"Derakhshan","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Hossein","family":"Esfandiari","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]},{"given":"Elif","family":"Tan","sequence":"additional","affiliation":[{"name":"Ankara University, Ankara, Turkey"}]},{"given":"Hadi","family":"Yami","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.006"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755586"},{"key":"e_1_3_2_1_3_1","volume-title":"Sublinear estimation of weighted matchings in dynamic data streams. arXiv preprint arXiv:1505.02019","author":"Bury M.","year":"2015","unstructured":"M. Bury and C. Schwiegelshohn . Sublinear estimation of weighted matchings in dynamic data streams. arXiv preprint arXiv:1505.02019 , 2015 . M. Bury and C. Schwiegelshohn. Sublinear estimation of weighted matchings in dynamic data streams. arXiv preprint arXiv:1505.02019, 2015."},{"key":"e_1_3_2_1_4_1","volume-title":"Kernelization via sampling with applications to dynamic graph streams. arXiv preprint arXiv:1505.01731","author":"Chitnis R.","year":"2015","unstructured":"R. Chitnis , G. Cormode , H. Esfandiari , M. Hajiaghayi , A. McGregor , M. Monemizadeh , and S. Vorotnikova . Kernelization via sampling with applications to dynamic graph streams. arXiv preprint arXiv:1505.01731 , 2015 . R. Chitnis, G. Cormode, H. Esfandiari, M. Hajiaghayi, A. McGregor, M. Monemizadeh, and S. Vorotnikova. Kernelization via sampling with applications to dynamic graph streams. arXiv preprint arXiv:1505.01731, 2015."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755618"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.82"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.81"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346079"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.55"},{"key":"e_1_3_2_1_10_1","volume-title":"matematikai \u00e9s fizikai lapok, 38: 116--119","author":"Konig D.","year":"1931","unstructured":"D. Konig . Gr\u00e1fok \u00e9s m \u00e1trixok . matematikai \u00e9s fizikai lapok, 38: 116--119 , 1931 . D. Konig. Gr\u00e1fok \u00e9s m\u00e1trixok. matematikai \u00e9s fizikai lapok, 38: 116--119, 1931."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989493.1989505"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_15"},{"key":"e_1_3_2_1_13_1","first-page":"17","volume-title":"Foundations of Computer Science, 1980., 21st Annual Symposium on","author":"Micali S.","year":"1980","unstructured":"S. Micali and V. V. Vazirani . An $o(\\sqrt|v||e|)$ algoithm for finding maximum matching in general graphs . In Foundations of Computer Science, 1980., 21st Annual Symposium on , pages 17 -- 27 . IEEE, 1980 . S. Micali and V. V. Vazirani. An $o(\\sqrt|v||e|)$ algoithm for finding maximum matching in general graphs. In Foundations of Computer Science, 1980., 21st Annual Symposium on, pages 17--27. IEEE, 1980."}],"event":{"name":"SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Washington DC USA","acronym":"SPAA '17"},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087601","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087601"}},"subtitle":["Graph Matching in Massive Datasets"],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":13,"alternative-id":["10.1145\/3087556.3087601","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087601","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}