{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:18Z","timestamp":1725516258241},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693833"},{"type":"electronic","value":"9783540693840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69384-0_33","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T06:39:15Z","timestamp":1217486355000},"page":"274-283","source":"Crossref","is-referenced-by-count":5,"title":["A Fast and Efficient Algorithm for Topology-Aware Coallocation"],"prefix":"10.1007","author":[{"given":"Valentin","family":"Kravtsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Swain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Dubin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Werner","family":"Dubitzky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Assaf","family":"Schuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","unstructured":"Charlot, M., et al.: The QosCosGrid project: Quasi-Opportunistic Supercomputing for Complex Systems Simulations. In: Description of a general framework from different types of applications. Ibergrid conference, Centro de Supercomputacion de Galicia (GESGA) (2007)"},{"key":"33_CR2","unstructured":"Kravtsov, V., Carmeli, D., Schuster, A., Yoshpa, B., Silberstein, M., Dubitzky, W.: Quasi-Opportunistic Supercomputing in Grids, Hot Topic Paper. In: IEEE International Symposium on High Performance Distributed Computing, Monterey Bay, California, USA (2007)"},{"issue":"3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D. Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. International Journal of Pattern Recognition and Artificial Intelligence\u00a018(3), 265\u2013298 (2004)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell.\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullman","year":"1976","unstructured":"Ullman, J.R.: An algorithm for subgraph isomorphism. J. Assoc. Comput. Mach.\u00a023, 31\u201342 (1976)","journal-title":"J. Assoc. Comput. Mach."},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Cordella, L.P., Foggia, P., Sansone, C., Tortorella, F., Vento, M.: Graph matching: a fast algorithm and its evaluation. In: 14th Int. Conf. Pattern Recognition, pp. 1582\u20131584 (1998)","DOI":"10.1109\/ICPR.1998.712014"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Gregory, L., Kittler, J.: Using graph search techniques for contextual colour retrieval. In: Joint IAPR Int. Workshops SSPR and SPR, pp. 186\u2013194 (2002)","DOI":"10.1007\/3-540-70659-3_19"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/T-C.1973.223602","volume":"22","author":"M. Fischler","year":"1973","unstructured":"Fischler, M., Elschlager, R.: The representation and matching of pictorial structures. IEEE Trans. Computing\u00a022, 67\u201392 (1973)","journal-title":"IEEE Trans. Computing"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R. Myers","year":"2000","unstructured":"Myers, R., Wilson, R.C., Hancock, E.R.: Bayesian graph edit distance. IEEE Trans. Patt. Anal. Mach. Intell.\u00a022, 628\u2013635 (2000)","journal-title":"IEEE Trans. Patt. Anal. Mach. Intell."},{"key":"33_CR10","volume-title":"Matching Theory","author":"L. Lovasz","year":"1986","unstructured":"Lovasz, L., Plummer, M.D.: Matching Theory. Elsevier Science Publishing Company, New York (1986)"},{"key":"33_CR11","unstructured":"Blum, N.: A Simplified Realization of the Hopcroft-Karp Approach to Maximum Matching in General Graphs. Univ. of Bonn, Computer Science V, 85232-CS (2001)"},{"key":"33_CR12","first-page":"588","volume-title":"Introduction to Algorithms, The Bellman-Ford algorithm","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms, The Bellman-Ford algorithm, pp. 588\u2013592. MIT Press and McGraw-Hill, New York, USA (2001)"},{"issue":"3","key":"33_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P.M. Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. Journal of Global Optimization\u00a04(3), 301\u2013328 (1994)","journal-title":"Journal of Global Optimization"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Khot, S.: Improved Inapproximability Results for MaxClique, Chromatic Number and Approximate Graph Coloring. In: Proceedings of the 42nd IEEE Symposium on the Foundations of Computer Science 600, Washington, DC, USA (2001)","DOI":"10.1109\/SFCS.2001.959936"},{"key":"33_CR15","volume-title":"The LEDA Platform of Combinatorial and Geometric Computing","author":"K. Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., Naeher, S.: The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"key":"33_CR16","unstructured":"Andrew, M.: GNU Linear Programming Kit, Version 4.22. \n                    \n                      http:\/\/www.gnu.org\/software\/glpk\/glpk.html"},{"key":"33_CR17","unstructured":"Bonami, P., et al.: Research Report RC 23771, An Algorithmic Framework For Convex Mixed Integer Nonlinear Programs. IBM T. J. Watson Research Center, Yorktown, USA (2005)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2008"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69384-0_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,2]],"date-time":"2019-03-02T11:47:26Z","timestamp":1551527246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69384-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540693833","9783540693840"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69384-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}