{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:01:34Z","timestamp":1742961694015,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877783"},{"type":"electronic","value":"9783540877790"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87779-0_36","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T05:17:14Z","timestamp":1222060634000},"page":"500-501","source":"Crossref","is-referenced-by-count":3,"title":["A Distributed Algorithm for Computing and Updating the Process Number of a Forest"],"prefix":"10.1007","author":[{"given":"David","family":"Coudert","sequence":"first","affiliation":[]},{"given":"Florian","family":"Huc","sequence":"additional","affiliation":[]},{"given":"Dorian","family":"Mazauric","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"36_CR1","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. Journal of Algorithms\u00a047(1), 40\u201359 (2003)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"36_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"M. Kirousis","year":"1986","unstructured":"Kirousis, M., Papadimitriou, C.: Searching and pebbling. Theoretical Computer Science\u00a047(2), 205\u2013218 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"36_CR3","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 pathwidth. Information Processing Letters\u00a042(6), 345\u2013350 (1992)","journal-title":"Information Processing Letters"},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J. Ellis","year":"1994","unstructured":"Ellis, J., Sudborough, I., Turner, J.: The vertex separation and search number of a graph. Information and Computation\u00a0113(1), 50\u201379 (1994)","journal-title":"Information and Computation"},{"key":"36_CR5","unstructured":"Fomin, F.V., Thilikos, D.: An annotated bibliography on guaranteed graph searching. Theoretical Computer Science, Special Issue on Graph Searching (to appear)"},{"key":"36_CR6","unstructured":"Coudert, D., Perennes, S., Pham, Q.C., Sereni, J.S.: Rerouting requests in wdm networks. In: AlgoTel 2005, Presqu\u2019\u00eele de Giens, France, pp. 17\u201320 (2005)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Coudert, D., Huc, F., Mazauric, D.: A distributed algorithm for computing and updating the process number of a forest. Research Report 6560, INRIA (2008)","DOI":"10.1007\/978-3-540-92221-6_37"},{"key":"36_CR8","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and applications of graphs","author":"T.D. Parsons","year":"1978","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. In: Theory and applications of graphs. Lecture Notes in Mathematics, vol.\u00a0642, pp. 426\u2013441. Springer, Berlin (1978)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87779-0_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T04:09:10Z","timestamp":1714795750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87779-0_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877783","9783540877790"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87779-0_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}