{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T05:28:56Z","timestamp":1740720536727,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642167195"},{"type":"electronic","value":"9783642167201"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16720-1_2","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:40:14Z","timestamp":1288705214000},"page":"13-24","source":"Crossref","is-referenced-by-count":5,"title":["Graph Partitioning Strategies for Efficient BFS in Shared-Nothing Parallel Systems"],"prefix":"10.1007","author":[{"given":"Victor","family":"Munt\u00e9s-Mulero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Norbert","family":"Mart\u00ednez-Baz\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josep-Llu\u00eds","family":"Larriba-Pey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esther","family":"Pacitti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Valduriez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/BF02510238","volume":"37","author":"C. Ashcraft","year":"1997","unstructured":"Ashcraft, C., Liu, J.W.H.: Using domain decomposition to find graph bisectors. BIT Numerical Mathematics\u00a037(3), 506\u2013534 (1997)","journal-title":"BIT Numerical Mathematics"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/12.762522","volume":"48","author":"R. Battiti","year":"1999","unstructured":"Battiti, R., Bertossi, A.A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Trans. Comput.\u00a048(4), 361\u2013385 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1132952.1132954","volume":"38","author":"D. Chakrabarti","year":"2006","unstructured":"Chakrabarti, D., Faloutsos, C.: Graph mining: Laws, generators, and algorithms. ACM Computing Surveys (CSUR)\u00a038(1), 2 (2006)","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"2_CR4","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th dimacs challenge 9 benchmark platform, version 1.1(october 30, 2006), http:\/\/www.dis.uniroma1.it\/~challenge9"},{"key":"2_CR5","first-page":"175","volume-title":"DAC 1982: Proceedings of the 19th Design Automation Conference","author":"C.M. Fiduccia","year":"1982","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: DAC 1982: Proceedings of the 19th Design Automation Conference, pp. 175\u2013181. IEEE Press, Piscataway (1982)"},{"key":"2_CR6","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell system technical journal\u00a049(1), 291\u2013307 (1970)","journal-title":"The Bell system technical journal"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1145\/1321440.1321521","volume-title":"CIKM 2007: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management","author":"N. Mart\u00ednez-Bazan","year":"2007","unstructured":"Mart\u00ednez-Bazan, N., Munt\u00e9s-Mulero, V., G\u00f3mez-Villamor, S., Nin, J., S\u00e1nchez-Mart\u00ednez, M.-A., Larriba-Pey, J.-L.: Dex: high-performance exploration on large graphs for information retrieval. In: CIKM 2007: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pp. 573\u2013582. ACM, New York (2007)"},{"key":"2_CR9","volume-title":"Principles of distributed database systems","author":"M.T. \u00d6zsu","year":"1999","unstructured":"\u00d6zsu, M.T., Valduriez, P.: Principles of distributed database systems, 2nd edn. Prentice-Hall, Inc., Upper Saddle River (1999)","edition":"2"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/12.8730","volume":"38","author":"L.A. Sanchis","year":"1989","unstructured":"Sanchis, L.A.: Multiple-way network partitioning. IEEE Trans. Comput.\u00a038(1), 62\u201381 (1989)","journal-title":"IEEE Trans. Comput."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/1247480.1247573","volume-title":"SIGMOD 2007: Proceedings of the 2007 ACM SIGMOD international conference on Management of data","author":"S. Trissl","year":"2007","unstructured":"Trissl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD 2007: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pp. 845\u2013856. ACM, New York (2007)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"van Helden, J., Naim, A., Mancuso, R., Eldridge, M., Wernisch, L., Gilbert, D., Wodak, S.: Representing and analysing molecular and cellular function using the computer. Biological Chemistry 381(i9\u201310), 921\u2013935 (2000)","DOI":"10.1515\/BC.2000.113"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Yoo, A., Chow, E., Henderson, K., McLendon, W., Hendrickson, B., Catalyurek, U.: A scalable distributed parallel breadth-first search algorithm on bluegene\/l. In: SC 2005: Proceedings of the, ACM\/IEEE conference on Supercomputing, p. 25. IEEE Computer Society, Washington (2005)","DOI":"10.1109\/SC.2005.4"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16720-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,27]],"date-time":"2025-02-27T13:44:29Z","timestamp":1740663869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16720-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642167195","9783642167201"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16720-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}