{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:21Z","timestamp":1759637841752},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"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":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00240-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:46:25Z","timestamp":1027651585000},"page":"407-427","source":"Crossref","is-referenced-by-count":14,"title":["Algorithms for generalized vertex-rankings of partial k-trees"],"prefix":"10.1016","volume":"240","author":[{"given":"Md.Abul","family":"Kashem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00240-6_BIB1","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","article-title":"Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees","volume":"11","author":"Bodlaender","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB2","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","article-title":"A linear-time algorithm for finding tree-decompositions of small treewidth","volume":"25","author":"Bodlaender","year":"1996","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB3","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1137\/S0895480195282550","article-title":"Rankings of graphs","volume":"21","author":"Bodlaender","year":"1998","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB4","doi-asserted-by":"crossref","unstructured":"H.L. Bodlaender, T. Hagerup, Parallel algorithms with optimal speedup for bounded treewidth, Proc. 22nd Int. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 944, Springer, Berlin, 1995, pp. 268\u2013279.","DOI":"10.1007\/3-540-60084-1_80"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB5","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","article-title":"Efficient and constructive algorithms for the pathwidth and treewidth of graphs","volume":"21","author":"Bodlaender","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB6","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF01293664","article-title":"Generation of polynomial time algorithms for some optimization problems on tree-decomposable graphs","volume":"14","author":"Borie","year":"1995","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1142\/S0129626492000155","article-title":"Optimal tree ranking is in NC","volume":"2","author":"de la Torre","year":"1992","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB8","first-page":"592","volume":"13","author":"de la Torre","year":"1995","journal-title":"Optimal edge ranking of trees in polynomial time, Algorithmica"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB9","doi-asserted-by":"crossref","unstructured":"J.S. Deogun, T. Kloks, D. Kratsch, H. M\u00fcller, On vertex ranking for permutation and other graphs, Proc. 11th Ann. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 775, Springer, Berlin, 1994, pp. 747\u2013758.","DOI":"10.1007\/3-540-57785-8_187"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","article-title":"The multifrontal solution of indefinite sparse symmetric linear equations","volume":"9","author":"Duff","year":"1983","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB11","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"Iyer","year":"1988","journal-title":"Optimal node ranking of trees, Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB12","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","article-title":"On an edge-ranking problem of trees and graphs","volume":"30","author":"Iyer","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB13","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB14","doi-asserted-by":"crossref","unstructured":"M.A. Kashem, X. Zhou, T. Nishizeki, Generalized vertex-rankings of partial k-trees, Proc. 3rd. Ann. Int. Computing and Combinatorics Conf. (COCOON\u201997), Lecture Notes in Computer Science, Vol. 1276, Springer, Berlin, 1997, pp. 212\u2013221.","DOI":"10.1007\/BFb0045088"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB15","doi-asserted-by":"crossref","unstructured":"M.A. Kashem, X. Zhou, T. Nishizeki, An NC parallel algorithm for generalized vertex-rankings of partial k-trees, Proc. Int. Symp. on Parallel Architectures, Algorithms and Networks (I-SPAN\u201997), pp. 105\u2013111.","DOI":"10.1109\/ISPAN.1997.645078"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","article-title":"Ordered colorings","volume":"142","author":"Katchalski","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB17","doi-asserted-by":"crossref","unstructured":"T. Kloks, H. M\u00fcller, C.K. Wong, Vertex ranking of asteroidal triple-free graphs, Proc. 7th Int. Symp. on Algorithms and Computation (ISAAC\u201996), Lecture Notes in Computer Science, Vol. 1178, Springer, Berlin, 1996, pp. 174\u2013182.","DOI":"10.1007\/BFb0009493"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB18","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0166-218X(98)00029-8","article-title":"Edge ranking of graphs is hard","volume":"85","author":"Lam","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB19","unstructured":"T.W. Lam, F.L. Yue, Optimal edge ranking of trees in linear time, Proc. Ninth ACM-SIAM Symp. Discrete Algorithms, 1998, pp. 436\u2013445."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB20","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","article-title":"The role of elimination trees in sparse factorization","volume":"11","author":"Liu","year":"1990","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB21","unstructured":"A. Pothen, The complexity of optimal elimination trees, Technical Report CS-88-13, Pennsylvania State University, USA, 1988."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB22","doi-asserted-by":"crossref","unstructured":"B.A. Reed, Finding approximate separators and computing tree-width quickly, Proc. 24th Ann. ACM Symp. on Theory of Computing, 1992, pp. 221\u2013228.","DOI":"10.1145\/129712.129734"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB23","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","article-title":"Graph minors. II. Algorithmic aspect of tree-width","volume":"7","author":"Robertson","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB24","doi-asserted-by":"crossref","unstructured":"A.A. Sch\u00e4ffer, Optimal node ranking of trees in linear time, Inform. Process. Lett. 33 (1989\/90) 91\u201396.","DOI":"10.1016\/0020-0190(89)90161-0"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB25","series-title":"Handbook of Theoretical Computer Science, A","first-page":"527","article-title":"Graph algorithms","author":"van Leeuwen","year":"1990"},{"key":"10.1016\/S0304-3975(99)00240-6_BIB26","unstructured":"X. Zhou, M.A. Kashem, T. Nishizeki, Generalized edge-rankings of trees, Proc. 22nd. Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201996), Lecture Notes in Computer Science, Vol. 1197, Springer, Berlin, 1997, pp. 390\u2013404, also IEICE Trans. on Fundamentals of Electronics, Commun. Comput. Sci. E81-A (2) (1998) 310\u2013320."},{"key":"10.1016\/S0304-3975(99)00240-6_BIB27","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0020-0190(95)00172-7","article-title":"Generalized vertex-rankings of trees","volume":"56","author":"Zhou","year":"1995","journal-title":"Informat. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002406?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002406?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T04:49:28Z","timestamp":1580878168000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002406"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00240-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}