{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:26:46Z","timestamp":1743017206834,"version":"3.40.3"},"publisher-location":"Wiesbaden","reference-count":12,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783815420331"},{"type":"electronic","value":"9783322952332"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-322-95233-2_13","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:17:04Z","timestamp":1366175824000},"page":"215-233","source":"Crossref","is-referenced-by-count":7,"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","reference":[{"key":"13_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":"13_CR2","doi-asserted-by":"publisher","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. \u03bb1, isometric inequalities for graphs, and supercon-centrators. J. Combinatorial Theory B 38 (1985), 73\u201388.","journal-title":"J. Combinatorial Theory B"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"TN Bui","year":"1987","unstructured":"T.N. Bui, S. Chanduri, F.T. Leighton and M. Sipser. Graph bisection algorithms with good average case behavior. Combinatorica 7 (1987), 171\u2013191.","journal-title":"Combinatorica"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"A. Broder and 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":"13_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"22","author":"Z Gabber","year":"1981","unstructured":"Gabber Z. and Z. Galil. Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22 (1981), 407\u2013420.","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"M.R. Garey and D.S. Johnson. Some simplified NP-complete graph problems. Theor. Comp. Science 1 (1976), 237\u2013267.","journal-title":"Theor. Comp. Science"},{"key":"13_CR7","volume-title":"Optimization by simulated annealing: An experimental evaluation (Part I)","author":"DS Johnson","year":"1985","unstructured":"D.S. Johnson, CR. Aragon, L.A. Mc Geoch and C. Schevon. Optimization by simulated annealing: An experimental evaluation (Part I). Preprint, AT + T Bell Labs, Murray Hill, NY (1985)."},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"B.W. Kernighan and 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":"13_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF02126799","volume":"8","author":"A Lubotzky","year":"1988","unstructured":"A. Lubotzky, R. Phillips and P. Sarnak. Ramanujan graphs. Combinatorica 8 (1988), No. 3, 261\u2013277.","journal-title":"Combinatorica"},{"key":"13_CR10","volume-title":"The Megaframe Hyper-cluster - A reconfigurable architecture for massively parallel computers","author":"H M\u00fchlenbein","year":"1989","unstructured":"H. M\u00fchlenbein, O. Kr\u00e4mer, G. Peise and R. Rinn. The Megaframe Hyper-cluster - A reconfigurable architecture for massively parallel computers. IEEE Conference on Computer Architecture, Jerusalem 1989."},{"key":"13_CR11","unstructured":"D.A. Nicole. Esprit Project 1085, Reconfigurable Transputer Processor Architecture, Proc. CONPAR 88, 12\u201339."},{"key":"13_CR12","doi-asserted-by":"publisher","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":["TEUBNER-TEXTE zur Informatik","Informatik"],"original-title":[],"language":"de","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-95233-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T10:40:13Z","timestamp":1674124813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-322-95233-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783815420331","9783322952332"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-95233-2_13","relation":{},"ISSN":["1615-4584"],"issn-type":[{"type":"print","value":"1615-4584"}],"subject":[],"published":{"date-parts":[[1992]]}}}