{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:40:26Z","timestamp":1648723226856},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2004,9]]},"abstract":"<jats:p> We prove that the cutwidth of the n-dimensional shuffle-exchange graph is at most \u23082<jats:sup>n+1<\/jats:sup>\/n\u2309, for n\u226510. This essentially improves on the previous best constant factors. As a consequence we obtain an improved upper bound for the cutwidth of the de Bruijn graph. <\/jats:p>","DOI":"10.1142\/s0129626404001945","type":"journal-article","created":{"date-parts":[[2005,5,24]],"date-time":"2005-05-24T11:56:24Z","timestamp":1116935784000},"page":"361-366","source":"Crossref","is-referenced-by-count":1,"title":["IMPROVED BOUNDS ON CUTWIDTHS OF SHUFFLE-EXCHANGE AND DE BRUIJN GRAPHS"],"prefix":"10.1142","volume":"14","author":[{"given":"BURKHARD","family":"MONIEN","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer  Science, University of Paderborn, F\u00fcrstenallee 11,  D-33102 Paderborn, Germany"}]},{"given":"IMRICH","family":"VR\u0164O","sequence":"additional","affiliation":[{"name":"Department of Informatics, Institute  of Mathematics, Slovak Academy of Sciences, D\u00fabravsk\u00e1 9,  841 04 Bratislava, Slovak Republic"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)00040-K"},{"key":"rf2","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1051\/ita\/1995290604871","volume":"29","author":"Barth D.","journal-title":"RAIRO - Theoretical Informatics and Applications"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"rf5","volume-title":"Computers and Intractability - A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"rf8","volume-title":"Introduction to Parallel Algorithms and Architectures","author":"Leighton F. T.","year":"1992"},{"key":"rf9","volume-title":"Complexity Issues in VLSI","author":"Leighton F. T.","year":"1983"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/T-ED.1980.20086"},{"key":"rf13","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1051\/ita\/1995290605091","volume":"29","author":"Raspaud A.","journal-title":"RAIRO \u2013 Theoretical Informatics and Applications"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1145\/4221.4228"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626404001945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T13:38:32Z","timestamp":1565185112000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626404001945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":10,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2004,9]]}},"alternative-id":["10.1142\/S0129626404001945"],"URL":"https:\/\/doi.org\/10.1142\/s0129626404001945","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}