{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:51:19Z","timestamp":1725583879197},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215001"},{"type":"electronic","value":"9783642215018"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21501-8_53","type":"book-chapter","created":{"date-parts":[[2011,5,30]],"date-time":"2011-05-30T09:45:30Z","timestamp":1306748730000},"page":"425-432","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite Graph Matching on GPU over Complete or Local Grid Neighborhoods"],"prefix":"10.1007","author":[{"given":"Cristina Nader","family":"Vasconcelos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bodo","family":"Rosenhahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00247653","volume":"1","author":"D.P. Bertsekas","year":"1992","unstructured":"Bertsekas, D.P.: Auction algorithms for network flow problems: A tutorial introduction. Computational Optimization and Applications\u00a01, 7\u201366 (1992)","journal-title":"Computational Optimization and Applications"},{"key":"53_CR2","first-page":"212","volume":"5","author":"D.P. Bertsekas","year":"1993","unstructured":"Bertsekas, D.P., Castaon, D.A.: Parallel asynchronous hungarian methods for the assignment problem. ACM Trans. on Database Syst.\u00a05, 212\u2013230 (1993)","journal-title":"ACM Trans. on Database Syst."},{"unstructured":"Cuda programming guide (2007), \n                    \n                      http:\/\/developer.download.nvidia.com\/","key":"53_CR3"},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"unstructured":"Vasconcelos, C.N.: Bgm code, \n                    \n                      http:\/\/www.ic.uff.br\/~crisnv\/bgm\/bgm.html","key":"53_CR5"},{"key":"53_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-03641-5_4","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"C.N. Vasconcelos","year":"2009","unstructured":"Vasconcelos, C.N., Rosenhahn, B.: Bipartite graph matching computation on GPU. In: Cremers, D., Boykov, Y., Blake, A., Schmidt, F.R. (eds.) EMMCVPR 2009. LNCS, vol.\u00a05681, pp. 42\u201355. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Advances in Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21501-8_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T02:52:43Z","timestamp":1553741563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21501-8_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215001","9783642215018"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21501-8_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}