{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:25Z","timestamp":1759063465635},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1007\/bf01581147","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:41:12Z","timestamp":1114681272000},"page":"211-239","source":"Crossref","is-referenced-by-count":35,"title":["A computational study of graph partitioning"],"prefix":"10.1007","volume":"66","author":[{"given":"Julie","family":"Falkner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Wolkowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0095-8956(85)90092-9","volume":"38","author":"N. Alon","year":"1985","unstructured":"N. Alon and V.D. Milman, \u201c\u03bb 1, isoperimetric inequalities for graphs and superconcentrators,\u201dJCT 38 (1985) 73\u201388.","journal-title":"JCT"},{"key":"CR2","volume-title":"Personal communication, technical report","author":"S. Areibi","year":"1993","unstructured":"S. Areibi and A. Vannelli, Personal communication, technical report, University of Waterloo, Waterloo, Ontario, Canada, 1993."},{"key":"CR3","volume-title":"\u201cA fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems,\u201d technical report RNR-092-033","author":"S.T. Barnard","year":"1992","unstructured":"S.T. Barnard and H.D. Simon, \u201cA fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems,\u201d technical report RNR-092-033, NASA Ames Research Center, Moffett Field, CA 94035, November 1992 (to appear inConcurrency: Practice and Experience)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"E.R. Barnes","year":"1982","unstructured":"E.R. Barnes, \u201cAn algorithm for partitioning the nodes of a graph,\u201dSIAM Journal on Algebraic and Discrete Mathematics 3 (1982) 541\u2013550.","journal-title":"SIAM Journal on Algebraic and Discrete Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0401030","volume":"1","author":"E.R. Barnes","year":"1988","unstructured":"E.R. Barnes, A. Vannelli and J.Q. Walker, \u201cA new heuristic for partitioning the nodes of a graph,\u201dSIAM Journal on Discrete Mathematics 1 (1988) 299\u2013305.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"CR6","first-page":"280","volume-title":"Proceedings of the 28th Annual Symposium on Computer Science","author":"R.B. Boppana","year":"1987","unstructured":"R.B. Boppana, \u201cEigenvalues and graph bisection: An average case analysis,\u201d in:Proceedings of the 28th Annual Symposium on Computer Science (IEEE, London, 1987) pp. 280\u2013285."},{"key":"CR7","unstructured":"T.N. Bui and C. Jones, \u201cA heuristic for reducing fill-in in sparse matrix factorization,\u201d in:Proceedings of the 6th SIAM Conference on Parallel Processing, 1993."},{"key":"CR8","unstructured":"T.N. Bui and B.R. Moon, \u201cHyperplane synthesis for genetic algorithms,\u201d in:Proceedings of the 5th International Conference on Genetic Algorithms, 1993."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120698","volume":"3","author":"J. Cullum","year":"1975","unstructured":"J. Cullum, W.E. Donath and P. Wolfe, \u201cThe minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices,\u201dMathematical Programming Study 3 (1975) 35\u201355.","journal-title":"Mathematical Programming Study"},{"key":"CR10","volume-title":"Spectra of Graphs \u2014 Theory and Applications","author":"D.M. Cvetkovic","year":"1979","unstructured":"D.M. Cvetkovic, M. Doob and H. Sachs,Spectra of Graphs \u2014 Theory and Applications (Academic Press, New York, NY, 1979)."},{"issue":"1","key":"CR11","first-page":"15","volume":"12","author":"D. Deuermeyer","year":"1990","unstructured":"D. Deuermeyer, \u201cLarge-scale solutions in structural analysis,\u201dCRAY Channels 12(1) (1990) 15\u201317.","journal-title":"CRAY Channels"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W.E. Donath","year":"1973","unstructured":"W.E. Donath and A.J. Hoffman, \u201cLower bounds for the partitioning of graphs,\u201dIBM Journal of Research and Development 17 (1973) 420\u2013425.","journal-title":"IBM Journal of Research and Development"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/43.144852","volume":"11","author":"S.W. Hadley","year":"1992","unstructured":"S.W. Hadley, B.L. Mark and A. Vannelli, \u201cAn efficient eigenvector approach for finding netlist partitions,\u201dIEEE Transactions on Computer-Aided Design 11 (1992) 885\u2013892.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R. Horn","year":"1985","unstructured":"R. Horn and C. Johnson,Matrix Analysis (Cambridge University Press, New York, 1985)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, \u201cOptimization by simulated annealing: an experimental evaluation; part 1, graph partitioning,\u201dOperations Research 37 (1989) 865\u2013892.","journal-title":"Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","volume":"36","author":"M. Juvan","year":"1992","unstructured":"M. Juvan and B. Mohar, \u201cOptimal linear labelings and eigenvalues of graphs,\u201dDiscrete Applied Mathematics 36 (1992) 153\u2013168.","journal-title":"Discrete Applied Mathematics"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"B.W. Kernighan and S. Lin, \u201cAn efficient heuristic procedure for partitioning graphs,\u201dThe Bell System Technical Journal 49 (1970) 291\u2013307.","journal-title":"The Bell System Technical Journal"},{"key":"CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial algorithms for integrated circuit layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer,Combinatorial algorithms for integrated circuit layout (John Wiley and Sons, Chicester, 1990)."},{"key":"CR19","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger,Linear and Nonlinear Programming, second edition (Addison-Wesley, Reading, Massachusetts, 1984).","edition":"second edition"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588778","volume":"49","author":"M.R. Rao","year":"1990","unstructured":"M.R. Rao M. Conforti and A. Sassano, \u201cThe equipartition polytope i and ii,\u201dMathematical Programming 49 (1990) 49\u201390.","journal-title":"Mathematical Programming"},{"key":"CR21","volume-title":"A projection technique for partitioning the nodes of a graph. Technical Report CORR 90-20","author":"F. Rendl","year":"1990","unstructured":"F. Rendl and H. Wolkowicz, A projection technique for partitioning the nodes of a graph. Technical Report CORR 90-20, University of Waterloo, Waterloo, Canada, 1990."},{"key":"CR22","volume-title":"Advances in Mathematical Optimization","author":"H. Schramm","year":"1988","unstructured":"H. Schramm and J. Zowe, \u201cA combination of the bundle approach and the trust region concept,\u201d in: J. Guddat et al., editor,Advances in Mathematical Optimization (Akademie Verlag Berlin, 1988)."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H. Schramm","year":"1992","unstructured":"H. Schramm and J. Zowe, \u201cA version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results,\u201dSIAM Journal on Optimization 2 (1992) 121\u2013152.","journal-title":"SIAM Journal on Optimization"},{"key":"CR24","unstructured":"D.S. Scott, Block lanczos software for symmetric eigenvalue problems, technical report 84-08, Oak Ridge National laboratory, 1979."},{"key":"CR25","volume-title":"Personal communication, technical report","author":"H. Simon","year":"1993","unstructured":"H. Simon, Personal communication, technical report, NASA Ames Research Center, Moffett Field, CA, 1993."},{"issue":"2\/3","key":"CR26","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, \u201cPartitioning of unstructured problems for parallel processing,\u201dComputing Systems in Engineering 2(2\/3) (1991) 135\u2013148.","journal-title":"Computing Systems in Engineering"},{"issue":"2","key":"CR27","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF00129774","volume":"6","author":"V. Venkatakrishnan","year":"1992","unstructured":"V. Venkatakrishnan, H. Simon and T. Barth, \u201cA mimd implementation of a parallel Euler solver for unstructured grids,\u201dThe Journal of Supercomputing 6(2) (1992) 117\u2013127.","journal-title":"The Journal of Supercomputing"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(80)90201-3","volume":"31","author":"H. Wolkowicz","year":"1980","unstructured":"H. Wolkowicz and G.P.H. Styan, \u201cMore bounds for eigenvalues using traces,\u201dLinear Algebra and its Applications 31 (1980) 1\u201317.","journal-title":"Linear Algebra and its Applications"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581147.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581147\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:55:04Z","timestamp":1586231704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["BF01581147"],"URL":"https:\/\/doi.org\/10.1007\/bf01581147","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}