{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T15:30:19Z","timestamp":1758123019803},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658313"},{"type":"electronic","value":"9783540489320"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/bfb0097982","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T14:45:17Z","timestamp":1164379517000},"page":"978-985","source":"Crossref","is-referenced-by-count":14,"title":["A graph based method for generating the fiedler vector of irregular problems"],"prefix":"10.1007","author":[{"given":"Michael","family":"Holzrichter","sequence":"first","affiliation":[]},{"given":"Suely","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,10,28]]},"reference":[{"key":"100_CR1","unstructured":"S. Barnard and H. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. In Proceedings of the Sixth SIAM Conference on Parallel Processing for Scientific Computing, Norfolk, Virginia, 1993. SIAM, SIAM."},{"key":"100_CR2","doi-asserted-by":"crossref","unstructured":"L. Borges and S. Oliveira. A parallel Davidson-type algorithm for several eigenvalues. Journal of Computational Physics, (144):763\u2013770, August 1998.","DOI":"10.1006\/jcph.1998.6003"},{"issue":"3","key":"100_CR3","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1137\/S1064827594262649","volume":"18","author":"T. Chan","year":"1997","unstructured":"T. Chan, P. Ciarlet Jr., and W. K. Szeto. On the optimality of the median cut spectral bisection graph partitioning method. SIAM Journal on Computing, 18(3):943\u2013948, 1997.","journal-title":"SIAM Journal on Computing"},{"key":"100_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0021-9991(75)90065-0","volume":"17","author":"E. Davidson","year":"1975","unstructured":"E. Davidson. The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices. Journal of Computational Physics, 17:87\u201394, 1975.","journal-title":"Journal of Computational Physics"},{"key":"100_CR5","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298\u2013305, 1973.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"100_CR6","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/BF01591018","volume":"25","author":"M. Fiedler","year":"1975","unstructured":"M. Fiedler. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal, 25:619\u2013632, 1975.","journal-title":"Czechoslovak Mathematical Journal"},{"key":"100_CR7","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1137\/S0895479896312262","volume":"19","author":"S. Guattery","year":"1998","unstructured":"S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal on Matrix Analysis and Applications, 19:701\u2013719, 1998.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"100_CR8","unstructured":"M. Holzrichter and S. Oliveira. New spectral graph partitioning algorithms. submitted."},{"key":"100_CR9","unstructured":"M. Holzrichter and S. Oliveira. New graph partitioning algorithms. 1998. The University of Iowa TR-120."},{"key":"100_CR10","unstructured":"G. Karypis and V. Kumar. Multilevel k-way partitioning scheme for irregular garphs. to appear in the Journal of Parallel and Distributed Computing."},{"issue":"1","key":"100_CR11","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, 20(1):359\u2013392, 1999.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"100_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. Kernighan","year":"1970","unstructured":"B. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291\u2013307, February 1970.","journal-title":"The Bell System Technical Journal"},{"key":"100_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971026","volume-title":"Multilevel Adaptive Methods for Partial Differential Equations","author":"S. McCormick","year":"1989","unstructured":"S. McCormick. Multilevel Adaptive Methods for Partial Differential Equations. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania, 1989."},{"key":"100_CR14","doi-asserted-by":"crossref","unstructured":"S. Oliveira. A convergence proof of an iterative subspace method for eigenvalues problem. In F. Cucker and M. Shub, editors, Foundations of Computational Mathematics Selected Papers, pages 316\u2013325. Springer, January 1997.","DOI":"10.1007\/978-3-642-60539-0_25"},{"issue":"3","key":"100_CR15","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"Alex Pothen, Horst D. Simon, and Kang-Pu Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl., 11(3):430\u2013452, 1990. Sparse matrices (Gleneden Beach, OR, 1989).","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"5","key":"100_CR16","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1137\/S1064827593255135","volume":"18","author":"H. D. Simon","year":"1997","unstructured":"H. D. Simon and S. H. Teng. How good is recursive bisection. SIAM Journal on Scientific Computing, 18(5):1436\u20131445, July 1997.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"100_CR17","doi-asserted-by":"crossref","unstructured":"D. Spielman and S. H. Teng. Spectral partitioning works: planar graphs and finite element meshes. In 37th Annual Symposium Foundations of Computer Science, Burlington, Vermont, October 1996. IEEE, IEEE Press.","DOI":"10.1109\/SFCS.1996.548468"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0097982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T03:52:34Z","timestamp":1628135554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0097982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658313","9783540489320"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0097982","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}