{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:00Z","timestamp":1759637760972},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540625599"},{"type":"electronic","value":"9783540680727"}],"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\/3-540-62559-3_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:41:39Z","timestamp":1330296099000},"page":"390-404","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Generalized edge-rankings of trees"],"prefix":"10.1007","author":[{"given":"Xiao","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Abul","family":"Kashem","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":[[2005,6,3]]},"reference":[{"key":"31_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974."},{"key":"31_CR2","unstructured":"H. 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":"31_CR3","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":"31_CR4","volume-title":"Technical Report 93-13","author":"P. Torre de la","year":"1993","unstructured":"P. de la Torre, R. Greenlaw, and A. A. Sch\u00e4ffer, A note on Deogun and Peng's edge ranking algorithm, Technical Report 93-13, Dept. of Computer Science, Univ. of New Hampshire, Durham, New Hampshire 03824, USA, 1993."},{"key":"31_CR5","first-page":"19","volume":"79","author":"J. S. Deogun","year":"1990","unstructured":"J. S. Deogun and Y. Peng, Edge ranking of trees, Congressus Numerantium, 79 (1990), pp. 19\u201328.","journal-title":"Congressus Numerantium"},{"key":"31_CR6","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":"31_CR7","unstructured":"A. V. Iyer, H. D. Ratliff, and G. Vijayan, Parallel assembly of modular products \u2014 art analysis, Technical Report PDRC, Technical Report 88-06, Georgia Institute of Technology, 1988."},{"key":"31_CR8","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":"31_CR9","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms, Journal of the ACM, 30 (1983), pp. 852\u2013865.","journal-title":"Journal of the ACM"},{"key":"31_CR10","volume-title":"Technical Report CS-88-13","author":"A. Pothen","year":"1988","unstructured":"A. Pothen, The complexity of optimal elimination trees, Technical Report CS-88-13, Pennsylvania State University, USA, 1988."},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(89)90161-0","volume":"33","author":"A. A. Sch\u00e4ffer","year":"1989\/90","unstructured":"A. A. Sch\u00e4ffer, Optimal node ranking of trees in linear time, Information Processing Letters, 33 (1989\/90), pp. 91\u201396.","journal-title":"Information Processing Letters"},{"key":"31_CR12","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"},{"key":"31_CR13","unstructured":"X. Zhou and T. Nishizeki, An efficient algorithm for edge-ranking trees, Proc. of the 2nd. European Symp. on Algorithms, Lecture Notes in Computer Science, Springer-Verlag, 855 (1994), pp. 118\u2013129."},{"key":"31_CR14","unstructured":"X. Zhou and T. Nishizeki, Finding optimal edge-rankings of trees, Proc. of the 6th Annual ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 122\u2013131."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62559-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:16:43Z","timestamp":1578529003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62559-3_31"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540625599","9783540680727"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-62559-3_31","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":"3 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}