{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:56:48Z","timestamp":1725537408696},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"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-04128-0_4","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T18:16:36Z","timestamp":1252952196000},"page":"35-46","source":"Crossref","is-referenced-by-count":13,"title":["A Linear Time Algorithm for L(2,1)-Labeling of Trees"],"prefix":"10.1007","author":[{"given":"Toru","family":"Hasunuma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshimasa","family":"Ishii","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotaka","family":"Ono","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yushi","family":"Uno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"H.L. Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximations for \u03bb-coloring of graphs. The Computer Journal\u00a047, 193\u2013204 (2004)","journal-title":"The Computer Journal"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T. Calamoneri","year":"2006","unstructured":"Calamoneri, T.: The L(h,k)-labelling problem: A survey and annotated bibliography. The Computer Journal\u00a049, 585\u2013608 (2006), http:\/\/www.dsi.uniroma1.it\/~calamo\/PDF-FILES\/survey.pdf (January 13, 2009)","journal-title":"The Computer Journal"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"220","author":"G.J. Chang","year":"2000","unstructured":"Chang, G.J., Ke, W.-T., Kuo, D., Liu, D.D.-F., Yeh, R.K.: On L(d,1)-labeling of graphs. Discr. Math.\u00a0220, 57\u201366 (2000)","journal-title":"Discr. Math."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"G.J. Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The L(2,1)-labeling problem on graphs. SIAM J. Discr. Math.\u00a09, 309\u2013316 (1996)","journal-title":"SIAM J. Discr. Math."},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/11523468_30","volume-title":"Automata, Languages and Programming","author":"J. Fiala","year":"2005","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Distance constrained labelings of graphs of bounded treewidth. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 360\u2013372. Springer, Heidelberg (2005)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-540-79228-4_11","volume-title":"Theory and Applications of Models of Computation","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Distance constrained labelings of trees. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 125\u2013135. Springer, Heidelberg (2008)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-70575-8_25","volume-title":"Automata, Languages and Programming","author":"J. Fiala","year":"2008","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Computational complexity of the distance constrained labeling problem for trees (Extended abstract). In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J. Fiala","year":"2001","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-parameter complexity of \u03bb-labelings. Discr. Appl. Math.\u00a0113, 59\u201372 (2001)","journal-title":"Discr. Appl. Math."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045, 783\u2013797 (1998)","journal-title":"J. ACM"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Disc. Math.\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. Disc. Math."},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-69903-3_18","volume-title":"Algorithm Theory \u2013 SWAT 2008","author":"T. Hasunuma","year":"2008","unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: An O(n 1.75) algorithm for L(2,1)-labeling of trees. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol.\u00a05124, pp. 185\u2013197. Springer, Heidelberg (2008)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A linear time algorithm for L(2,1)-labeling of trees. CoRR abs\/0810.0906 (2008)","DOI":"10.1007\/978-3-642-04128-0_4"},{"key":"4_CR13","unstructured":"Havet, F., Reed, B., Sereni, J.-S.: L(2,1)-labelling of graphs. In: Proc. 19th SIAM-SODA, pp. 621\u2013630 (2008)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n5\/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-540-74456-6_46","volume-title":"Mathematical Foundations of Computer Science 2007","author":"J. Kratochv\u00edl","year":"2007","unstructured":"Kratochv\u00edl, J., Kratsch, D., Liedloff, M.: Exact algorithms for L(2,1)-labeling of graphs. In: Ku\u010dera, L., Ku\u010dera, A. (eds.) MFCS 2007. LNCS, vol.\u00a04708, pp. 513\u2013524. Springer, Heidelberg (2007)"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1016\/j.dam.2005.09.007","volume":"154","author":"W.-F. Wang","year":"2006","unstructured":"Wang, W.-F.: The L(2,1)-labelling of trees. Discr. Appl. Math.\u00a0154, 598\u2013603 (2006)","journal-title":"Discr. Appl. Math."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"R.K. Yeh","year":"2006","unstructured":"Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discr. Math.\u00a0306, 1217\u20131231 (2006)","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:21:57Z","timestamp":1558538517000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}