{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:17:49Z","timestamp":1725459469520},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045088","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T09:16:11Z","timestamp":1139217371000},"page":"212-221","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generalized vertex-rankings of partial k-trees"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H.L. Bodlaender","year":"1990","unstructured":"H.L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, Journal of Algorithms, 11 (1990), pp. 631\u2013643.","journal-title":"Journal of Algorithms"},{"key":"23_CR2","doi-asserted-by":"crossref","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput., 25 (1996), pp. 1305\u20131317.","journal-title":"SIAM J. Comput."},{"unstructured":"H.L. Bodlaender, J.S. Deogun, K. Jansen, T. Kloks, D. Kratsch, H. M\u00fcller, and Zs. Tuza, Rankings of graphs, Proc. of the International Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, Springer-Verlag, 903 (1994), pp. 292\u2013304.","key":"23_CR3"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender and T. Kloks, Efficient and constructive algorithms for the pathwidth and treewidth of graphs, Journal of Algorithms, 21 (1996), pp. 358\u2013402.","journal-title":"Journal of Algorithms"},{"key":"23_CR5","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1007\/BF01189071","volume":"13","author":"P. Torre de la","year":"1995","unstructured":"P. de la Torre, R. Greenlaw, and A.A. Sch\u00e4ffer, Optimal edge ranking of trees in polynomial time, Algorithmica, 13 (1995), pp. 592\u2013618.","journal-title":"Algorithmica"},{"key":"23_CR6","first-page":"747","volume":"775","author":"J.S. Deogun","year":"1994","unstructured":"J.S. Deogun, T. Kloks, D. Kratsch, and H. M\u00fcller, On vertex ranking for permutation and other graphs, Proc. of the 11th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer-Verlag, 775 (1994), pp. 747\u2013758.","journal-title":"Proc. of the 11th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Springer-Verlag"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I.S. Duff","year":"1983","unstructured":"I.S. Duff and J.K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Transactions on Mathematical Software, 9 (1983), pp. 302\u2013325.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"A.V. Iyer","year":"1988","unstructured":"A.V. Iyer, H.D. Ratliff, and G. Vijayan, Optimal node ranking of trees, Information Processing Letters, 28 (1988), pp. 225\u2013229.","journal-title":"Information Processing Letters"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"A.V. Iyer","year":"1991","unstructured":"A.V. Iyer, H.D. Ratliff, and G. Vijayan, On an edge-ranking problem of trees and graphs, Discrete Applied Mathematics, 30 (1991), pp. 43\u201352.","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","volume":"142","author":"M. Katchalski","year":"1995","unstructured":"M. Katchalski, W. McCuaig, and S. Seager, Ordered colorings, Discrete Mathematics, 142 (1995), pp. 141\u2013154.","journal-title":"Discrete Mathematics"},{"unstructured":"T.W. Lam and F.L. Yue, The NP-completeness of edge ranking, Manuscript, 1996.","key":"23_CR11"},{"key":"23_CR12","series-title":"Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory","first-page":"527","volume-title":"Graph algorithms","author":"J. Leeuwen van","year":"1990","unstructured":"J. van Leeuwen, Graph algorithms, In Handbook of Theoretical Computer Science, A: Algorithms and Complexity Theory, Amsterdam, North-Holland, 1990, pp. 527\u2013631."},{"key":"23_CR13","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM Journal of Matrix Analysis and Applications, 11 (1990), pp. 134\u2013172.","journal-title":"SIAM Journal of Matrix Analysis and Applications"},{"unstructured":"A. Pothen, The complexity of optimal elimination trees, Technical Report CS-88-13, Pennsylvania State University, USA, 1988.","key":"23_CR14"},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"N. Robertson and P.D. Seymour, Graph minors. II. Algorithmic aspect of tree-width, Journal of Algorithms, 7 (1986), pp. 309\u2013322.","journal-title":"Journal of Algorithms"},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A.A. Schiffer","year":"1989","unstructured":"A.A. Schiffer, Optimal node ranking of trees in linear time, Information Processing Letters, 33 (1989\/90), pp. 91\u201396.","journal-title":"Information Processing Letters"},{"key":"23_CR17","first-page":"390","volume":"1197","author":"X. Zhou","year":"1997","unstructured":"X. Zhou, M.A. Kashem, and T. Nishizeki, Generalized edge-rankings of trees, Proc. of the 22nd. International Workshop on Graph-Theoretic Concepts in Computer Science (WG'96), Lecture Notes in Computer Science, Springer-Verlag, 1197 (1997), pp. 390\u2013404.","journal-title":"Proc. of the 22nd. International Workshop on Graph-Theoretic Concepts in Computer Science (WG'96), Lecture Notes in Computer Science, Springer-Verlag"},{"key":"23_CR18","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0020-0190(95)00172-7","volume":"56","author":"X. Zhou","year":"1995","unstructured":"X. Zhou, H. Nagai, and T. Nishizeki, Generalized vertex-rankings of trees, Information Processing Letters, 56 (1995), pp. 321\u2013328.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T15:49:12Z","timestamp":1578498552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045088"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0045088","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"24 January 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}