{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:36:24Z","timestamp":1725561384168},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206958"},{"type":"electronic","value":"9783540245872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_48","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"464-473","source":"Crossref","is-referenced-by-count":0,"title":["An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees"],"prefix":"10.1007","author":[{"given":"Md. Abul","family":"Kashem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Ziaur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"Abrahamson, K., Dadoun, N., Kirkpatrick, D.G., Przytycka, T.: A simple parallel tree contraction algorithm. Journal of Algorithms\u00a010, 287\u2013302 (1989)","journal-title":"Journal of Algorithms"},{"key":"48_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"21","author":"H. Bodlaender","year":"1998","unstructured":"Bodlaender, H., Deogun, J.S., Jansen, K., Kloks, T., M\u00fcller, H.H., Tuza, Z.: Rankings of graphs. SIAM Journal of Discrete Math.\u00a021, 168\u2013181 (1998)","journal-title":"SIAM Journal of Discrete Math."},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1142\/S0129626492000155","volume":"2","author":"P. Torre de la","year":"1992","unstructured":"de la Torre, P., Greenlaw, R., Przytycka, T.M.: Optimal tree ranking is in NC. Parallel Processing Letters\u00a02, 31\u201341 (1992)","journal-title":"Parallel Processing Letters"},{"key":"48_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0020-0190(88)90194-9","volume":"28","author":"A.V. Iyer","year":"1988","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: Optimal vertex ranking of trees. Information Processing Letters\u00a028, 225\u2013229 (1988)","journal-title":"Information Processing Letters"},{"key":"48_CR5","volume-title":"An Introduction to Parallel Algorithms","author":"J.J. J\u00e1","year":"1992","unstructured":"J\u00e1, J.J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"key":"48_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0304-3975(99)00240-6","volume":"240","author":"M.A. Kashem","year":"2000","unstructured":"Kashem, M.A., Zhou, X., Nishizeki, T.: Algorithms for generalized vertexrankings of partial k-trees. Theoretical Computer Science\u00a0240, 407\u2013427 (2000)","journal-title":"Theoretical Computer Science"},{"key":"48_CR7","unstructured":"Pothen, A.: The complexity of optimal elimination trees, Technical Report CS-88-13, Pennsylvania State University, U.S.A (1988)"},{"key":"48_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A.A. Sch\u00e4ffer","year":"1989","unstructured":"Sch\u00e4ffer, A.A.: Optimal vertex ranking of trees in linear time. Information Processing Letters\u00a033, 91\u201399 (1989)","journal-title":"Information Processing Letters"},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0020-0190(95)00172-7","volume":"56","author":"X. Zhou","year":"1995","unstructured":"Zhou, X., Nagai, N., Nishizeki, T.: Generalized vertex-rankings of trees. Information Processing Letters\u00a056, 321\u2013328 (1995)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T15:12:46Z","timestamp":1552835566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}