{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:17Z","timestamp":1725663377645},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_57","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:33:02Z","timestamp":1330183982000},"page":"378-393","source":"Crossref","is-referenced-by-count":3,"title":["Bandwidth and profile minimization"],"prefix":"10.1007","author":[{"given":"Manfred","family":"Wiegers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/0602041","volume":"2","author":"S. F. Assmann","year":"1981","unstructured":"S. F. Assmann, G. W. Peck, M. M. Syslo, and J. Zak. The bandwidth of catterpilars with hairs of length 1 and 2. SIAM J. Algebraic and Discret Methodes, 2:387\u2013393, 1981.","journal-title":"SIAM J. Algebraic and Discret Methodes"},{"key":"26_CR2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P. Z. Chinn","year":"1982","unstructured":"P. Z. Chinn, J. Chv\u00e1talov\u00e1, A. K. Dewedney, and N. E. Gibbs. The bandwidth problem for graphs and matrices \u2014 a survey. Journal of Graph Theory, 6:223\u2013254, 1982.","journal-title":"Journal of Graph Theory"},{"key":"26_CR3","unstructured":"E. Cuthill and J. Mckee. Reducing the bandwidth of matrices. In Proc. 24th Nat. Conf. ACM, pages 157\u2013166, 1969."},{"key":"26_CR4","unstructured":"S. Even. Graph Algorithms. Computer Science Press, Inc., 1979."},{"key":"26_CR5","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1002\/nme.1620140606","volume":"14","author":"G. C. Everstine","year":"1979","unstructured":"G. C. Everstine. A comparision of three resequencing algorithm for the reduction of matrix profile and wavefront. International journal for numerical methods in engineering, 14:837\u2013853, 1979.","journal-title":"International journal for numerical methods in engineering"},{"key":"26_CR6","unstructured":"G. C. Everstine. Bandwidth test results. Personal communication, 1988."},{"key":"26_CR7","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"N. E. Gibbs","year":"1976","unstructured":"N. E. Gibbs, W. G. Pool Jr., and P. K. Stockmeyer. An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numerical Analysis, 13:236\u2013250, 1976.","journal-title":"SIAM J. Numerical Analysis"},{"key":"26_CR8","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"E. T. Gurari","year":"1984","unstructured":"E. T. Gurari and I. H. Sudborough. Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. Journal of Algorithms, 5:531\u2013546, 1984.","journal-title":"Journal of Algorithms"},{"key":"26_CR9","first-page":"77","volume":"50","author":"E. O. Hare","year":"1985","unstructured":"E. O. Hare, W. R. Hare, and S. T. Hendetniemi. Another upper bound for the bandwidths of trees. Congressus Numerantium 50, 77\u201383, 1985.","journal-title":"Congressus Numerantium"},{"key":"26_CR10","unstructured":"D. Kratsch. Finding the Minimum Bandwidth of an Interval Graph. Manuskript N\/86\/18, Friedrich-Schiller-Universit\u00e4t Jena, 1986."},{"key":"26_CR11","first-page":"61","volume":"1","author":"R. Levy","year":"1971","unstructured":"R. Levy. Resequencing of the structural stiffness matrix to improve computational efficiency. Jet Propulsion Laboratory Quart. Tech. Review, 1:61\u201370, 1971.","journal-title":"Jet Propulsion Laboratory Quart. Tech. Review"},{"key":"26_CR12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1137\/0713020","volume":"13","author":"W.-H. Liu","year":"1976","unstructured":"W.-H. Liu and A. H. Sherman. Comparative analysis of the Cuthill-McKee and the reverse Cuthill-McKee ordering algorithms for sparse matrices. SIAM J. Numerical Analysis, 13:198\u2013213, 1976.","journal-title":"SIAM J. Numerical Analysis"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn. Data Structures and Algorithms. Volume 1, Sorting and Searching, EATCS Monographs on Theoretical Computer Sience, 1984.","DOI":"10.1007\/978-3-642-69672-5_2"},{"key":"26_CR14","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0607057","volume":"7","author":"B. Monien","year":"1986","unstructured":"B. Monien. The bandwidth \u2014 minimization problem for caterpillars with hair length 3 is NP-Complete. SIAM J. Algebraic and Discret Methodes, 7:505\u2013512, 1986.","journal-title":"SIAM J. Algebraic and Discret Methodes"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","volume":"16","author":"C. H. Papadimitriou","year":"1976","unstructured":"C. H. Papadimitriou. The NP-Completeness of the bandwidth minimization problem. Computing, 16:263\u2013270, 1976.","journal-title":"Computing"},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"J. B. Saxe. Dynamic programming algorithms for recognizing small bandwidth graphs in polynominal time. SIAM J. Algebraic and Discret Methodes, 363\u2013369, 1980.","DOI":"10.1137\/0601042"},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0215041","volume":"15","author":"J. S. Turner","year":"1986","unstructured":"J. S. Turner. On the probable performance of heuristics for bandwidth minimization. SIAM J. Computing, 15:561\u2013580, 1986.","journal-title":"SIAM J. Computing"},{"key":"26_CR18","unstructured":"M. Wiegers. Computing Lower Bounds of the Bandwidth. Manuscript, Universit\u00e4t GH Paderborn, 1988."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50728-0_57.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:49Z","timestamp":1605629929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}