{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:06:40Z","timestamp":1742958400782,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_39","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"543-555","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs"],"prefix":"10.1007","author":[{"given":"Shelby","family":"Kimmel","sequence":"first","affiliation":[]},{"given":"R. Teal","family":"Witter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"39_CR1","doi-asserted-by":"publisher","unstructured":"Ambainis, A.: Quantum lower bounds by quntum arguments. J. Comput. Syst. Sci. 64(4), 750\u2013767 (2002). https:\/\/doi.org\/10.1006\/jcss.2002.1826, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S002200000291826X","DOI":"10.1006\/jcss.2002.1826"},{"key":"39_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/11672142_13","volume-title":"STACS 2006","author":"A Ambainis","year":"2006","unstructured":"Ambainis, A., \u0160palek, R.: Quantum algorithms for matching and network flows. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 172\u2013183. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_13"},{"key":"39_CR3","doi-asserted-by":"publisher","unstructured":"Beigi, S., Taghavi, L.: Quantum speedup based on classical decision trees. Quantum 4, 241 (2020). https:\/\/doi.org\/10.22331\/q-2020-03-02-241, https:\/\/quantum-journal.org\/papers\/q-2020-03-02-241\/, publisher: Verein zur F\u00f6rderung des Open Access Publizierens in den Quantenwissenschaften","DOI":"10.22331\/q-2020-03-02-241"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-540-24618-3_11","volume-title":"SOFSEM 2004: Theory and Practice of Computer Science","author":"A Berzina","year":"2004","unstructured":"Berzina, A., Dubrovsky, A., Freivalds, R., Lace, L., Scegulnaja, O.: Quantum query complexity for some graph problems. In: Van Emde Boas, P., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 140\u2013150. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24618-3_11"},{"key":"39_CR5","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s00224-008-9118-x","volume":"45","author":"S D\u00f6rn","year":"2009","unstructured":"D\u00f6rn, S.: Quantum algorithms for matching problems. Theor. Comput. Syst. 45, 613\u2013628 (2009). https:\/\/doi.org\/10.1007\/s00224-008-9118-x","journal-title":"Theor. Comput. Syst."},{"key":"39_CR6","doi-asserted-by":"publisher","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965). https:\/\/doi.org\/10.4153\/CJM-1965-045-4, https:\/\/www.cambridge.org\/core\/journals\/canadian-journal-of-mathematics\/article\/paths-trees-and-flowers\/08B492B72322C4130AE800C0610E0E21","DOI":"10.4153\/CJM-1965-045-4"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Fujii, M., Kasami, T., Ninomiya, K.: Optimal sequencing of two equivalent processors. SIAM J. Appl. Math. 17(4), 784\u2013789 (1969). https:\/\/www.jstor.org\/stable\/2099319","DOI":"10.1137\/0117070"},{"key":"39_CR8","doi-asserted-by":"publisher","unstructured":"Gabow, H.N.: The weighted matching approach to maximum cardinality matching. Fundamenta Informaticae 154(1\u20134), 109\u2013130 (2017). https:\/\/doi.org\/10.3233\/FI-2017-1555, https:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi1555, publisher: IOS Press","DOI":"10.3233\/FI-2017-1555"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Karp, R.M.: An n$$^{\\wedge }$$(5\/2) algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. Philadelphia 2(4), 7 (1973). http:\/\/dx.doi.org.ezproxy.middlebury.edu\/10.1137\/0202019, http:\/\/search.proquest.com\/docview\/919736551\/abstract\/79AD5CB7D4BA4C4EPQ\/1, num Pages: 7 Place: Philadelphia, United States, Philadelphia Publisher: Society for Industrial and Applied Mathematics","DOI":"10.1137\/0202019"},{"key":"39_CR10","doi-asserted-by":"publisher","unstructured":"Hoyer, P., Lee, T., Spalek, R.: Negative weights make adversaries stronger. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 526\u2013535. STOC 2007, Association for Computing Machinery, San Diego, California, USA (2007). https:\/\/doi.org\/10.1145\/1250790.1250867, https:\/\/doi.org\/10.1145\/1250790.1250867","DOI":"10.1145\/1250790.1250867"},{"key":"39_CR11","doi-asserted-by":"publisher","unstructured":"Jeffery, S., Kimmel, S.: Quantum algorithms for graph connectivity and formula evaluation. Quantum 1, 26 (2017). https:\/\/doi.org\/10.22331\/q-2017-08-17-26, https:\/\/quantum-journal.org\/papers\/q-2017-08-17-26\/","DOI":"10.22331\/q-2017-08-17-26"},{"key":"39_CR12","doi-asserted-by":"publisher","unstructured":"Lee, T., Mittal, R., Reichardt, B.W., Spalek, R., Szegedy, M.: Quantum query complexity of state conversion. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp. 344\u2013353 (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.75, http:\/\/arxiv.org\/abs\/1011.3020, arXiv: 1011.3020","DOI":"10.1109\/FOCS.2011.75"},{"issue":"18","key":"39_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a018","volume":"12","author":"C Lin","year":"2016","unstructured":"Lin, C., Lin, H.H.: Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester. Theor. Comput. 12(18), 1\u201335 (2016). https:\/\/doi.org\/10.4086\/toc.2016.v012a018","journal-title":"Theor. Comput."},{"key":"39_CR14","doi-asserted-by":"publisher","unstructured":"May, J.W.: Cheminformatics for genome-scale metabolic reconstructions. Ph.D. Thesis, Cambridge University (2015). https:\/\/doi.org\/10.17863\/CAM.15987","DOI":"10.17863\/CAM.15987"},{"key":"39_CR15","doi-asserted-by":"publisher","unstructured":"Micali, S., Vazirani, V.V.: An O(sqrt(|v|)|E|) algorithm for finding maximum matching in general graphs. In: 21st Annual Symposium on Foundations of Computer Science (sfcs 1980), pp. 17\u201327 (Oct 1980). https:\/\/doi.org\/10.1109\/SFCS.1980.12, ISSN: 0272-5428","DOI":"10.1109\/SFCS.1980.12"},{"key":"39_CR16","doi-asserted-by":"publisher","unstructured":"Reichardt, B.W.: Span programs and quantum query complexity: the general adversary bound is nearly tight for every boolean function. In: 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 544\u2013551 (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.55, http:\/\/arxiv.org\/abs\/0904.2759, arXiv: 0904.2759","DOI":"10.1109\/FOCS.2009.55"},{"key":"39_CR17","unstructured":"Roth, A.E., Sonmez, T., Unver, M.U.: Pairwise Kidney Exchange. J. Econ. Theor. 125(2), 151\u2013188 (2005). https:\/\/www.hbs.edu\/faculty\/Pages\/item.aspx?num=19520"},{"key":"39_CR18","unstructured":"Vazirani, V.V.: A simplification of the MV matching algorithm and its proof. arXiv:1210.4594 [cs] (2013). http:\/\/arxiv.org\/abs\/1210.4594, arXiv: 1210.4594"},{"key":"39_CR19","doi-asserted-by":"publisher","unstructured":"Zhang, S.: On the power of ambainis lower bounds. Theor. Comput. Sci. 339(2), 241\u2013256 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.01.019, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397505001234","DOI":"10.1016\/j.tcs.2005.01.019"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:29:25Z","timestamp":1645183765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"123","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}