{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:48Z","timestamp":1759637568693},"reference-count":18,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5495,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1998,7]]},"DOI":"10.1016\/s0012-365x(98)00009-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:02Z","timestamp":1027609622000},"page":"163-176","source":"Crossref","is-referenced-by-count":13,"title":["Bandwidth and density for block graphs"],"prefix":"10.1016","volume":"189","author":[{"family":"Le Tu Quoc Hung","sequence":"first","affiliation":[]},{"given":"Maciej M.","family":"Sys\u0142o","sequence":"additional","affiliation":[]},{"given":"Margaret L.","family":"Weaver","sequence":"additional","affiliation":[]},{"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(98)00009-0_BIB1","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/0602041","article-title":"The bandwidth of caterpillars with hairs of length 1 and 2","volume":"2","author":"Assmann","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB2","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices \u2014 a survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB3","first-page":"151","article-title":"Labelings of graphs","volume":"III","author":"Chung","year":"1988"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB4","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","article-title":"Complexity results for bandwidth minimization","volume":"34","author":"Garey","year":"1978","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB6","series-title":"Proc. 13th SE Conf. Comb. G.T. Comp","first-page":"37","article-title":"A generalization of interval graphs with tolerances","volume":"35","author":"Golumbic","year":"1982"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(84)90016-7","article-title":"Tolerance graphs","volume":"9","author":"Golumbic","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4153\/CMB-1963-001-x","article-title":"A characterization of block-graphs","volume":"6","author":"Harary","year":"1963","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB9","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0403033","article-title":"Computing the bandwidth of interval graphs","volume":"3","author":"Kleitman","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB10","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","article-title":"On minimizing width in linear layouts","volume":"23","author":"Makedon","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB11","series-title":"Proc. Southeastern Conf.","first-page":"235","article-title":"The bandwidth of caterpillar graphs","volume":"33","author":"Miller","year":"1981"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB12","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0607057","article-title":"The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete","volume":"7","author":"Monien","year":"1986","journal-title":"SIAM J. Algebraic. Discrete Methods"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB13","first-page":"64","article-title":"A polynomial algorithm for finding the bandwidth of interval graphs","volume":"82","author":"Muradyan","year":"1986","journal-title":"Dokl. AN Arm. SSR"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02280884","article-title":"The NP-completeness of the bandwidth minimization problem","volume":"16","author":"Papadimitriou","year":"1976","journal-title":"Computing"},{"key":"10.1016\/S0012-365X(98)00009-0_BIB15","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0012-365X(93)E0219-T","article-title":"Bandwidth of the complete k-ary tree","volume":"142","author":"Smithline","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/S0895480192232333","article-title":"An O(n log n) algorithm for bandwidth of interval graphs","volume":"7","author":"Sprague","year":"1994","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB17_1","first-page":"281","article-title":"The bandwidth problem: critical subgraphs and the solution for caterpillars","volume":"16","author":"Sys\u0142o","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(98)00009-0_BIB17_2","article-title":"The bandwidth problem: critical subgraphs and the solution for caterpillars","author":"Sys\u0142o","year":"1980"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000090?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X98000090?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T21:28:15Z","timestamp":1555968495000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X98000090"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":18,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0012365X98000090"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(98)00009-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}