{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,12]],"date-time":"2025-04-12T04:56:16Z","timestamp":1744433776018,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023485","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:06:33Z","timestamp":1132365993000},"page":"511-522","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A better upper bound on the bisection width of de Bruijn networks"],"prefix":"10.1007","author":[{"given":"Rainer","family":"Feldmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Mysliwietz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Tsch\u00f6ke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"42_CR1","unstructured":"J.C. Bermond and C. Peyrat. De Bruijn and Kautz networks: a Competitor for the Hypercube? In Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, pages 279\u2013293. North-Holland, 1989."},{"key":"42_CR2","unstructured":"R. Diekmann, B. Monien and R. Preis. Using Helpful Sets to Improve Graph Bisections. In DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Am. Math. Society, 1995."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"R. Feldmann, B. Monien, P. Mysliwietz and S. Tsch\u00f6ke. A Better Upper Bound on the Bisection Width of de Bruijn Networks Technical report, University of Paderborn, 1996, to appear.","DOI":"10.1007\/BFb0023485"},{"key":"42_CR4","first-page":"211","volume":"520","author":"J. Hromkovic","year":"1991","unstructured":"J. Hromkovic and B. Monien. The Bisection Problem for Graphs of Degree 4 (configuring Transputer Systems). In Proceedings of the 16th Math. Foundations of Computer Science (MFCS'91), Springer LNCS 520, pp 211\u2013220, 1991.","journal-title":"Springer LNCS"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"F.T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"42_CR6","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner, 1994."},{"key":"42_CR7","doi-asserted-by":"crossref","unstructured":"E.P. Miles. Generalized Fibonacci Numbers and Associated Matrices. Am. Math. Month., pages 745\u2013752, 1960.","DOI":"10.1080\/00029890.1960.11989593"},{"key":"42_CR8","unstructured":"S. Perennes. Personal communication. 1995."},{"issue":"4","key":"42_CR9","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1109\/12.21149","volume":"38","author":"M.R. Samatham","year":"1989","unstructured":"M.R. Samatham and D.K. Pradhan. The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI. IEEE Transactions on Computers, 38(4):567\u2013581, 1989.","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023485","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:35:05Z","timestamp":1578526505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023485"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0023485","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"10 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}