{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T03:22:21Z","timestamp":1786764141151,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642303968","type":"print"},{"value":"9783642303975","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30397-5_10","type":"book-chapter","created":{"date-parts":[[2012,5,12]],"date-time":"2012-05-12T07:41:27Z","timestamp":1336808487000},"page":"108-119","source":"Crossref","is-referenced-by-count":27,"title":["A GPU Algorithm for Greedy Graph Matching"],"prefix":"10.1007","author":[{"given":"Bas O.","family":"Fagginger Auer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rob H.","family":"Bisseling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"6","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1860","DOI":"10.1137\/S1064827502401953","volume":"25","author":"C. Aykanat","year":"2004","unstructured":"Aykanat, C., Pinar, A., \u00c7ataly\u00fcrek, U.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM J. Sci. Comput.\u00a025(6), 1860\u20131879 (2004)","journal-title":"SIAM J. Sci. Comput."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Bader, D.A., Sanders, P., Wagner, D., Meyerhenke, H., Hendrickson, B., Johnson, D.S., Walshaw, C., Mattson, T.G.: 10th DIMACS implementation challenge - graph partitioning and graph clustering (2012), \n                    \n                      http:\/\/www.cc.gatech.edu\/dimacs10\/index.shtml","DOI":"10.1090\/conm\/588"},{"key":"10_CR3","unstructured":"Bell, N., Garland, M.: Cusp: Generic parallel algorithms for sparse matrix and graph computations, version 0.1.0 (2010), \n                    \n                      http:\/\/cusp-library.googlecode.com"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bertsekas, D.P.: A distributed asynchronous relaxation algorithm for the assignment problem. In: 24th IEEE CDC, vol.\u00a024, pp. 1703\u20131704 (1985)","DOI":"10.1109\/CDC.1985.268826"},{"issue":"7","key":"10_CR5","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"U.V. \u00c7ataly\u00fcrek","year":"1999","unstructured":"\u00c7ataly\u00fcrek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Par. Dist. Syst.\u00a010(7), 673\u2013693 (1999)","journal-title":"IEEE Trans. Par. Dist. Syst."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Davis, T.A., Hu, Y.: The University of Florida Sparse Matrix Collection. ACM TOMS\u00a038(1), 1:1\u20131:25 (2011)","DOI":"10.1145\/2049662.2049663"},{"issue":"6","key":"10_CR7","doi-asserted-by":"publisher","first-page":"3426","DOI":"10.1137\/080720395","volume":"32","author":"L. Grigori","year":"2010","unstructured":"Grigori, L., Boman, E.G., Donfack, S., Davis, T.A.: Hypergraph-based unsymmetric nested dissection ordering for sparse LU factorization. SIAM J. Sci. Comput.\u00a032(6), 3426\u20133446 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"10_CR8","unstructured":"Her, J.H., Pellegrini, F.: Efficient and scalable parallel graph partitioning. Parallel Computing (2010)"},{"issue":"6","key":"10_CR9","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.orl.2004.04.001","volume":"32","author":"A.B. Kahng","year":"2004","unstructured":"Kahng, A.B., Reda, S.: Match twice and stitch: a new TSP tour construction heuristic. Operations Research Letters\u00a032(6), 499\u2013509 (2004)","journal-title":"Operations Research Letters"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Sipser, M.: Maximum matchings in sparse random graphs. In: Proc. 22nd FOCS, pp. 364\u2013375 (1981)","DOI":"10.1109\/SFCS.1981.21"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Langguth, J., Manne, F., Sanders, P.: Heuristic initialization for bipartite matching problems. J. Exp. Algorithmics\u00a015(1.3), 1.1\u20131.22 (2010)","DOI":"10.1145\/1671970.1712656"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1007\/978-3-540-68111-3_74","volume-title":"Parallel Processing and Applied Mathematics","author":"F. Manne","year":"2008","unstructured":"Manne, F., Bisseling, R.H.: A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Wasniewski, J. (eds.) PPAM 2007. LNCS, vol.\u00a04967, pp. 708\u2013717. Springer, Heidelberg (2008)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Patwary, M.A., Bisseling, R.H., Manne, F.: Parallel greedy graph matching using an edge partitioning approach. In: Proc. HLPP 2010, pp. 45\u201354. ACM (2010)","DOI":"10.1145\/1863482.1863493"},{"key":"10_CR14","unstructured":"Preis, R.: Analyses and design of efficient graph partitioning methods. HNI-Verlagsschriftenreihe, Heinz Nixdorf Inst. Univ. Paderborn (2001)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD5 message-digest algorithm, Internet RFC 1321 (1992)","DOI":"10.17487\/rfc1321"},{"issue":"15","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1001\/jama.293.15.1883","volume":"293","author":"D.L. Segev","year":"2005","unstructured":"Segev, D.L., Gentry, S.E., Warren, D.S., Reeb, B., Montgomery, R.A.: Kidney paired donation and optimizing the use of live donor organs. JAMA\u00a0293(15), 1883\u20131890 (2005)","journal-title":"JAMA"},{"key":"10_CR17","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)"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0036144502409019","volume":"47","author":"B. Vastenhouw","year":"2005","unstructured":"Vastenhouw, B., Bisseling, R.H.: A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Rev.\u00a047(1), 67\u201395 (2005)","journal-title":"SIAM Rev."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Xing, G., Lu, C., Zhang, Y., Huang, Q., Pless, R.: Minimum power configuration for wireless communication in sensor networks. ACM Trans. Sen. Netw.\u00a03(2) (2007)","DOI":"10.1145\/1240226.1240231"}],"container-title":["Lecture Notes in Computer Science","Facing the Multicore - Challenge II"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30397-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:53:46Z","timestamp":1558299226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30397-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303968","9783642303975"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30397-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}