{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:33:48Z","timestamp":1725460428557},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540593935"},{"type":"electronic","value":"9783540492429"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0046658","type":"book-chapter","created":{"date-parts":[[2006,3,6]],"date-time":"2006-03-06T12:11:01Z","timestamp":1141647061000},"page":"392-397","source":"Crossref","is-referenced-by-count":9,"title":["Dynamic load balancing with a spectral bisection algorithm for the constrained graph partitioning problem"],"prefix":"10.1007","author":[{"given":"Rafael","family":"Van Driessche","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Roose","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,2]]},"reference":[{"issue":"2","key":"58_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S. T. Barnard","year":"1994","unstructured":"S. T. Barnard and H. D. Simon. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2):101\u2013117, April 1994.","journal-title":"Concurrency: Practice and Experience"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1016\/0024-3795(89)90494-1","volume":"114\/115","author":"W. Gander","year":"1989","unstructured":"W. Gander, G. H. Golub, and U. von Matt. A constrained eigenvalue problem. Linear Algebra and its Applications, 114\/115:815\u2013839, 1989.","journal-title":"Linear Algebra and its Applications"},{"key":"58_CR3","unstructured":"B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Labs, October 1993."},{"key":"58_CR4","unstructured":"W. F. Mitchell. Refinement tree based partitioning for adaptive grids. In D. H. Bailey et al., editors, Parallel Processing for Scientific Computing, pages 587\u2013592. SIAM, 1995."},{"issue":"3","key":"58_CR5","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430\u2013452, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"58_CR6","unstructured":"E. Pramono, H. D. Simon, and A. Sohn. Dynamic load balancing for finite element calculations on parallel computers. In D. H. Bailey et al., editors, Parallel Processing for Scientific Computing, pages 599\u2013604. SIAM, 1995."},{"issue":"2\/3","key":"58_CR7","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","volume":"2","author":"H. D. Simon","year":"1991","unstructured":"H. D. Simon. Partitioning of unstructured problems for parallel processing. Computing Systems in Engineering, 2(2\/3):135\u2013148, 1991.","journal-title":"Computing Systems in Engineering"},{"key":"58_CR8","volume-title":"TW Report 216","author":"R. Driessche Van","year":"1994","unstructured":"R. Van Driessche and D. Roose. A spectral algorithm for constrained graph partitioning I: The bisection case. TW Report 216, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, October 1994."},{"key":"58_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0167-8191(94)00059-J","volume":"21","author":"R. Driessche Van","year":"1995","unstructured":"R. Van Driessche and D. Roose. An improved spectral bisection algorithm and its application to dynamic load balancing. Parallel Computing, 21:29\u201348, 1995.","journal-title":"Parallel Computing"},{"key":"58_CR10","unstructured":"R. Van Driessche and D. Roose. A graph contraction algorithm for the fast calculation of the Fiedler vector of a graph. In D. H. Bailey et al., editors, Parallel Processing for Scientific Computing, pages 621\u2013626. SIAM, 1995."},{"key":"58_CR11","volume-title":"Math. research report","author":"C. Walshaw","year":"1995","unstructured":"C. Walshaw, M. Cross, and M. G. Everett. A parallelisable algorithm for optimising unstructured mesh partitions. Math. research report, School of Mathematics, Statistics & Scientific Computing, Univ. of Greenwich, London, January 1995."}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0046658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T17:27:05Z","timestamp":1549733225000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0046658"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540593935","9783540492429"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0046658","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}