{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:58:59Z","timestamp":1743062339082,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","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":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_11","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Self-stabilizing Graph Searching in Tree Networks"],"prefix":"10.1007","author":[{"given":"Jean","family":"Blair","sequence":"first","affiliation":[]},{"given":"Fredrik","family":"Manne","sequence":"additional","affiliation":[]},{"given":"Rodica","family":"Mihai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1093\/comjnl\/bxl081","volume":"50","author":"D. Bein","year":"2007","unstructured":"Bein, D., Datta, A.K., Karaata, M.H.: An optimal snap-stabilizing multi-wave algorithm. The Computer Journal\u00a050, 332\u2013340 (2007)","journal-title":"The Computer Journal"},{"key":"11_CR2","unstructured":"Blair, J.R.S., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 912\u2013921 (2003)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-540-87779-0_36","volume-title":"Distributed Computing","author":"D. Coudert","year":"2008","unstructured":"Coudert, D., Huc, F., Mazauric, D.: A distributed algorithm for computing and updating the process number of a forest. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 500\u2013501. Springer, Heidelberg (2008)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399, 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0898-1221(00)00183-8","volume":"40","author":"T.C. Huang","year":"2000","unstructured":"Huang, T.C., Lin, J.C., Chen, H.J.: A self-stabilizing algorithm which finds a 2-center of a tree. Computers and Mathematics with Applications\u00a040, 607\u2013624 (2000)","journal-title":"Computers and Mathematics with Applications"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N.G. Kinnersley","year":"1992","unstructured":"Kinnersley, N.G.: The vertex separation number of a graph equals its path-width. Inf. Process. Lett.\u00a042, 345\u2013350 (1992)","journal-title":"Inf. Process. Lett."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0166-218X(93)90171-J","volume":"43","author":"E. Korach","year":"1993","unstructured":"Korach, E., Solel, N.: Tree-width, path-width, and cutwidth. Discrete Appl. Math.\u00a043, 97\u2013101 (1993)","journal-title":"Discrete Appl. Math."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-642-05118-0_39","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"R. Mihai","year":"2009","unstructured":"Mihai, R., Mjelde, M.: A self-stabilizing algorithm for graph searching in trees. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol.\u00a05873, pp. 563\u2013577. Springer, Heidelberg (2009)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0304-3975(99)00241-8","volume":"240","author":"S. Peng","year":"2000","unstructured":"Peng, S., Ho, C., Hsu, T., Ko, M., Tang, C.: Edge and node searching problems on trees. Theor. Comput. Sci.\u00a0240, 429\u2013446 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0196-6774(02)00225-0","volume":"47","author":"K. Skodinis","year":"2003","unstructured":"Skodinis, K.: Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time. J. Algorithms\u00a047, 40\u201359 (2003)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:34:46Z","timestamp":1630726486000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}