{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:33:04Z","timestamp":1725535984265},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030949"},{"type":"electronic","value":"9783642030956"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03095-6_37","type":"book-chapter","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T13:40:55Z","timestamp":1248961255000},"page":"384-395","source":"Crossref","is-referenced-by-count":1,"title":["An On-Line Parallel Algorithm for Node Ranking of Trees"],"prefix":"10.1007","author":[{"given":"Chia-Wei","family":"Lee","sequence":"first","affiliation":[]},{"given":"Justie Su-Tzu","family":"Juan","sequence":"additional","affiliation":[]},{"given":"Tai-Lung","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(99)00217-6","volume":"103","author":"N. Abbas","year":"2000","unstructured":"Abbas, N., Stewart, L.K.: Biconvex Graphs: Ordering and Algorithms. Discrete Applied Mathematics\u00a0103, 1\u201319 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR2","volume-title":"Parallel Computation: Models and Methods","author":"S.G. Akl","year":"1997","unstructured":"Akl, S.G.: Parallel Computation: Models and Methods. Prentice Hall, NJ (1997)"},{"key":"37_CR3","volume-title":"A Textbook of Graph Theory","author":"R. Balakrishnan","year":"1999","unstructured":"Balakrishnan, R., Ranganathan, K.: A Textbook of Graph Theory. Springer, Heidelberg (1999)"},{"key":"37_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-55121-2_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"1992","unstructured":"Bodlaender, H.L., Gilbert, J.R., Hafsteninsson, H., Kloks, T.: Approximating Treewidth, Pathwidth and Minimum Elimination Tree Height. In: Schmidt, G., Berghammer, R. (eds.) WG 1991. LNCS, vol.\u00a0570, pp. 1\u201312. Springer, Heidelberg (1992)"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.7151\/dmgt.1094","volume":"19","author":"E. Bruoth","year":"1999","unstructured":"Bruoth, E., Hor\u0148\u00e1k, M.: On-Line Ranking Number for Cycles and Paths. Discussiones Mathematicae, Graph Theory\u00a019, 175\u2013197 (1999)","journal-title":"Discussiones Mathematicae, Graph Theory"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/3-540-57785-8_187","volume-title":"STACS 94","author":"J.S. Deogun","year":"1994","unstructured":"Deogun, J.S., Kloks, T., Kratsch, D., M\u00fcller, H.: On Vertex Ranking for Permutation and Other Graph. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds.) STACS 1994. LNCS, vol.\u00a0775, pp. 747\u2013758. Springer, Heidelberg (1994)"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I.S. Duff","year":"1983","unstructured":"Duff, I.S., Reid, J.K.: The Multifrontal Solution of Indefinite Sparse Symmetric Linear Equations. ACM Transactions on Mathematical Software\u00a09, 302\u2013325 (1983)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Hashem, T., Paul, U.K., Kashem, M.A.: An Algorithm for c-Vertex-Ranking of Starlike Graphs. In: Proceeding of 4th International Conference on Electrical and Computer Engineering ICECE 2006, Dhaka, Bangladesh, pp. 316\u2013319 (2006)","DOI":"10.1109\/ICECE.2006.355635"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(01)00262-9","volume":"82","author":"S.Y. Hsieh","year":"2002","unstructured":"Hsieh, S.Y.: On Vertex Ranking of a Starlike Graph. Information Processing Letters\u00a082, 31\u2013135 (2002)","journal-title":"Information Processing Letters"},{"key":"37_CR10","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 Node Ranking of Trees. Information Processing Letters\u00a028, 225\u2013229 (1988)","journal-title":"Information Processing Letters"},{"key":"37_CR11","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: Parallel Assembly of Modular Products-an Analysis. Technical Report, pp. 88\u201386, Georgia Institute of Technology, Atlanta, GA (1988)"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0166-218X(91)90012-L","volume":"30","author":"A.V. Iyer","year":"1991","unstructured":"Iyer, A.V., Ratliff, H.D., Vijayan, G.: On Edge Ranking Problems of Trees and Graphs. Discrete Applied Mathematics\u00a030, 43\u201352 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR13","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J\u00e1J\u00e1, J.: An Introduction to Parallel Algorithms. Addison-Wesley, Reading (1992)"},{"issue":"4","key":"37_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ipl.2004.07.007","volume":"92","author":"M.A. Kashem","year":"2004","unstructured":"Kashem, M.A., Rahman, M.Z.: An optimal parallel algorithm for c-vertex-ranking of trees. Information Processing Letters\u00a092(4), 179\u2013184 (2004)","journal-title":"Information Processing Letters"},{"issue":"2","key":"37_CR15","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 vertex-rankings of partial k-trees. Theoretical Computer Science\u00a0240(2), 407\u2013427 (2000)","journal-title":"Theoretical Computer Science"},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","volume":"142","author":"M. Katchalski","year":"1995","unstructured":"Katchalski, M., McCuaig, W., Seager, S.: Ordered Colorings. Discrete Mathematics\u00a0142, 141\u2013154 (1995)","journal-title":"Discrete Mathematics"},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/BFb0009493","volume-title":"Algorithms and Computation","author":"T. Kloks","year":"1996","unstructured":"Kloks, T., M\u00fcller, H., Wong, C.K.: Vertex Ranking of Asteroidal Triple-Free Graphs. In: Nagamochi, H., Suri, S., Igarashi, Y., Miyano, S., Asano, T. (eds.) ISAAC 1996. LNCS, vol.\u00a01178, pp. 174\u2013182. Springer, Heidelberg (1996)"},{"key":"37_CR18","unstructured":"Lee, C.W., Juan, J.S.T.: On-Line Ranking Algorithm for Trees. In: Proceeding of the 2005 International Conference on Foundations of Computer Science, Monte Carlo Resort, Las Vegas, Nevada, USA, June 27-30, pp. 46\u201351 (2005)"},{"key":"37_CR19","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: Area Efficient Graph Layouts for VLSI. In: Proceeding of the 21st Annual IEEE Symposium on Foundations of Computer Science, pp. 270\u2013281 (1980)","DOI":"10.1109\/SFCS.1980.13"},{"key":"37_CR20","doi-asserted-by":"crossref","unstructured":"Liang, Y., Dhall, S.K., Lakshmivarahan, S.: Parallel Algorithm for Ranking of Trees. In: Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing, pp. 26\u201331 (1990)","DOI":"10.1109\/SPDP.1990.143502"},{"key":"37_CR21","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0166-218X(98)00056-0","volume":"87","author":"C.M. Liu","year":"1998","unstructured":"Liu, C.M., Yu, M.S.: An Optimal Parallel Algorithm for Node Ranking of Cographs. Discrete Applied Mathematics\u00a087, 187\u2013201 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"37_CR22","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"Liu, J.W.H.: The Role of Elimination Trees in Sparse Factorization. SIAM Journal of Matrix Analysis and Applications\u00a011, 134\u2013172 (1990)","journal-title":"SIAM Journal of Matrix Analysis and Applications"},{"key":"37_CR23","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 Node Ranking of Trees in Linear Time. Information Processing Letters\u00a033, 91\u201396 (1989)","journal-title":"Information Processing Letters"},{"key":"37_CR24","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0012-365X(99)00215-0","volume":"212","author":"I. Schiermeyer","year":"2000","unstructured":"Schiermeyer, I., Tuza, Zs., Voigt, M.: On-Line Rankings of Graphs. Discrete Mathematics\u00a0212, 141\u2013147 (2000)","journal-title":"Discrete Mathematics"},{"key":"37_CR25","unstructured":"Semani\u0161in, G., Sot\u00e1k, R.: On-Line Ranking Number of Certain Classes of Graphs. In: Proceedings of the 4th Cracow Conference on Graph Theory (2002)"},{"key":"37_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(92)90017-P","volume":"43","author":"A. Sen","year":"1992","unstructured":"Sen, A., Deng, H., Guha, S.: On a Graph Partition Problem with Application to VLSI Layout. Information Processing Letters\u00a043, 87\u201394 (1992)","journal-title":"Information Processing Letters"},{"key":"37_CR27","unstructured":"Torre, P., Greenlaw, R., Sch\u00e4ffer, A.A.: Optimal Edge Ranking of Trees in Polynomial Time. In: Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms Austin, Texas, pp. 138\u2013144 (1993)"},{"key":"37_CR28","unstructured":"Wang, C.W., Yu, M.S.: An Algorithm for the Optimal Ranking Problem on Interval Graphs. In: Proceedings Joint Conference of International Computer Symposium, International Conference on Algorithms, pp. 51\u201358 (1996)"},{"key":"37_CR29","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2001)","edition":"2"},{"key":"37_CR30","unstructured":"Yu, M.S.: Optimal Node Ranking of Cographs. In: Proceedings of International Computer Symposium, Taiwan, pp. 1\u20136 (1994)"},{"issue":"6","key":"37_CR31","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(6), 321\u2013328 (1995)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03095-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T16:04:13Z","timestamp":1558454653000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03095-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030949","9783642030956"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03095-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}