{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:01:11Z","timestamp":1726520471686},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":4276,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1016\/s0166-218x(01)00220-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:01:51Z","timestamp":1027591311000},"page":"117-133","source":"Crossref","is-referenced-by-count":8,"title":["Bandwidth and topological bandwidth of graphs with few P4's"],"prefix":"10.1016","volume":"115","author":[{"given":"Ton","family":"Kloks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard B.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00220-7_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\/S0166-218X(01)00220-7_BIB2","unstructured":"L. Babel, On the P4-structure of graphs, Habilitationsschrift, Zentrum f\u00fcr Mathematik, Technische Universit\u00e4t M\u00fcnchen, 1997."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB3","unstructured":"L. Babel, T. Kloks, J. Kratochv\u0131́l, D. Kratsch, H. M\u00fcller, S. Olariu, Efficient algorithms for graphs with few P4's, Manuscript 1998."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB4","unstructured":"S. Baumann, A linear algorithm for the homogeneous decomposition of graphs, Report No. M-9615, Zentrum f\u00fcr Mathematik, Technische Universit\u00e4t M\u00fcnchen, 1996."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB5","doi-asserted-by":"crossref","unstructured":"H. Bodlaender M.R. Fellows, M.T. Hallet, Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy, Proceedings of the 26th Annual Symposium on the Theory of Computation, 1994, pp. 449\u2013458.","DOI":"10.1145\/195058.195229"},{"year":"1999","series-title":"Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications","author":"Brandst\u00e4dt","key":"10.1016\/S0166-218X(01)00220-7_BIB6"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB7","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","article-title":"The bandwidth problem for graphs and matrices\u2014a survey","volume":"6","author":"Chinn","year":"1982","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB8","unstructured":"F.R.K. Chung, Labelings of graphs, in: Selected Topics in Graph Theory, Vol. 3, Academic Press, London, 1988, pp. 151\u2013168."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB9","doi-asserted-by":"crossref","unstructured":"U. Feige, Approximating the bandwidth via volume respecting embeddings, Manuscript, 1998.","DOI":"10.1145\/276698.276716"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB10","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\/S0166-218X(01)00220-7_BIB11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.46298\/dmtcs.232","article-title":"On P4-tidy graphs","volume":"1","author":"Giakoumakis","year":"1997","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"year":"1980","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","key":"10.1016\/S0166-218X(01)00220-7_BIB12"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","article-title":"Improved dynamic programming algorithms for the bandwidth minimization and the mincut linear arrangement problem","volume":"5","author":"Gurari","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB14","doi-asserted-by":"crossref","unstructured":"W. Hochst\u00e4ttler, G. Tinhofer, Hamiltonicity in graphs with few P4's, Computing 54 (1995) 213\u2013225.","DOI":"10.1007\/BF02253613"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90085-B","article-title":"On a tree representation for P4-extendible graph","volume":"34","author":"Jamison","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB16","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB17","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","article-title":"Recognizing P4-sparse graphs in linear time","volume":"21","author":"Jamison","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-218X(94)00012-3","article-title":"Linear time optimization algorithms for P4-sparse graphs","volume":"61","author":"Jamison","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB19","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0895480191196812","article-title":"p-components and the homogeneous decomposition of graphs","volume":"8","author":"Jamison","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB20","unstructured":"S. Jiang, The bandwidth problem and bandwidth of cographs. Manuscript, 1992."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB21","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/S0097539793258143","article-title":"Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques","volume":"25","author":"Kaplan","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB22","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\/S0166-218X(01)00220-7_BIB23","doi-asserted-by":"crossref","unstructured":"T. Kloks, D. Kratsch, H. M\u00fcller, Approximating the bandwidth for AT-free graphs, Proceedings of the Third Annual European Symposium on Algorithms (ESA\u201995), Springer, Lecture Notes in Computer Science, Vol. 979, 1995, pp. 434\u2013447.","DOI":"10.1007\/3-540-60313-1_161"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB24","unstructured":"T. Kloks, D. Kratsch, H. M\u00fcller, Bandwidth of chain graphs, KAM-DIMATIA Series, 98\u2013390, Centre for Discrete Mathematics, Theoretical Computer Science and Applications (DIMATIA), Charles University, Prague, Czech Republic, 1998."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB25","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0890-5401(91)90045-4","article-title":"On finding the minimum bandwidth of interval graphs","volume":"95","author":"Mahesh","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB26","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0606044","article-title":"Topological bandwidth","volume":"6","author":"Makedon","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(01)00220-7_BIB27","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\/S0166-218X(01)00220-7_BIB28","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\/S0166-218X(01)00220-7_BIB29","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0012-365X(92)90268-K","article-title":"Bandwidth of theta graphs with short paths","volume":"103","author":"Peck","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(01)00220-7_BIB30","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\/S0166-218X(01)00220-7_BIB31","doi-asserted-by":"crossref","unstructured":"W. Unger, The complexity of the approximation of the bandwidth problem. Proceedings of FOCS\u201998, pp. 82\u201391.","DOI":"10.1109\/SFCS.1998.743431"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002207?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01002207?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,6]],"date-time":"2023-04-06T02:02:29Z","timestamp":1680746549000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01002207"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["S0166218X01002207"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00220-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}