{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:59:02Z","timestamp":1725663542439},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543459"},{"type":"electronic","value":"9783540475798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54345-7_64","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:42:01Z","timestamp":1330209721000},"page":"211-220","source":"Crossref","is-referenced-by-count":11,"title":["The bisection problem for graphs of degree 4 (configuring transputer systems)"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"21_CR1","first-page":"85","volume":"6","author":"N. Alon","year":"1986","unstructured":"N. Alon: Eigenvalues and expanders. Combinatorica 6 (1986), 85\u201395.","journal-title":"Combinatorica"},{"key":"21_CR2","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 \u2014 V.D. Milman: \u03bb1, isometric inequalities for graphs, and superconcentrators. J. Combinatorial Theory B 38 (1985), 73\u201388.","journal-title":"J. Combinatorial Theory B"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T.N. Bui","year":"1987","unstructured":"T.N. Bui \u2014 S. Chanduri \u2014 F.T. Leighton \u2014 M. Sipser: Graph bisection algorithms with good average case behavior. Combinatorica 7 (1987), 171\u2013191.","journal-title":"Combinatorica"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"A. Broder \u2014 E. Shamir: On the second eigenvalue of random regular graphs. In: Proc. 28th Annual Symp. on FOCS, IEEE 1987, 286\u2013294.","DOI":"10.1109\/SFCS.1987.45"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"22","author":"Gabber","year":"1981","unstructured":"Gabber \u2014 Z. Galil: Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22 (1981), 407\u2013420.","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR6","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey \u2014 D.S. Johnson: Some simplified NP-complete graph problems, Theor. Comp. Science 1 (1976), 237\u2013267.","journal-title":"Theor. Comp. Science"},{"key":"21_CR7","volume-title":"Optimization by simulated annealing: An experimental evaluation (Part I), Preprint, AT + T Bell Labs","author":"D.S. Johnson","year":"1985","unstructured":"D.S. Johnson \u2014 C.R. Aragon \u2014 L.A. Mc Geoch \u2014 C. Schevon: Optimization by simulated annealing: An experimental evaluation (Part I), Preprint, AT + T Bell Labs, Murray Hill, NY (1985)."},{"key":"21_CR8","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 \u2014 S. Lin: An efficient heuristic procedure for partitioning graphs, Bell Systems Techn. J. 49 (1970), 291\u2013307.","journal-title":"Bell Systems Techn. J."},{"issue":"3","key":"21_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A. Lubotzky","year":"1988","unstructured":"A. Lubotzky \u2014 R. Phillips \u2014 P. Sarnak: Ramanujan graphs. Combinatorica 8 (1988), No. 3, 261\u2013277.","journal-title":"Combinatorica"},{"key":"21_CR10","unstructured":"H. M\u00fchlenbein \u2014 O. Kr\u00e4mer \u2014 G. Peise \u2014 R. Rinn: The Megaframe Hypercluster \u2014 A reconfigurable architecture for massively parallel computers, IEEE Conference on Computer Architecture, Jerusalem 1989."},{"key":"21_CR11","unstructured":"D.A. Nicole, Esprit Project 1085, Reconfigurable Transputer Processor Architecture, Proc. CONPAR 88, 12\u201339."},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","volume":"15","author":"J. Petersen","year":"1891","unstructured":"J. Petersen: Die Theorie der regul\u00e4ren Graphs, Acta Mathematica 15 (1891), 193\u2013220.","journal-title":"Acta Mathematica"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1991"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54345-7_64.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:46Z","timestamp":1605646426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54345-7_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543459","9783540475798"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-54345-7_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}