{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:33:09Z","timestamp":1725521589137},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922209"},{"type":"electronic","value":"9783540922216"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92221-6_37","type":"book-chapter","created":{"date-parts":[[2008,12,3]],"date-time":"2008-12-03T08:25:04Z","timestamp":1228292704000},"page":"546-550","source":"Crossref","is-referenced-by-count":2,"title":["Computing and Updating the Process Number in Trees"],"prefix":"10.1007","author":[{"given":"David","family":"Coudert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Huc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorian","family":"Mazauric","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. I. Excluding a forest. J. Combin. Theory Ser. B\u00a035, 39\u201361 (1983)","journal-title":"J. Combin. Theory Ser. B"},{"key":"37_CR2","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, 50\u201379 (1994)","journal-title":"Information and Computation"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-642-46908-4_70","volume-title":"Topics in Combinatorics and Graph Theory","author":"P. Scheffler","year":"1990","unstructured":"Scheffler, P.: A linear algorithm for the pathwidth of trees. In: Bodendiek, R., Henn, R. (eds.) Topics in Combinatorics and Graph Theory, pp. 613\u2013620. Physica-Verlag, Heidelberg (1990)"},{"key":"37_CR4","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, 40\u201359 (2003)","journal-title":"Journal of Algorithms"},{"key":"37_CR5","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, 205\u2013218 (1986)","journal-title":"Theoretical Computer Science"},{"key":"37_CR6","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"F. Fomin","year":"2008","unstructured":"Fomin, F., Thilikos, D.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci.\u00a0399, 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey on graph layout problems. ACM Computing Surveys\u00a034, 313\u2013356 (2002)","journal-title":"ACM Computing Surveys"},{"key":"37_CR8","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":"37_CR9","unstructured":"Coudert, D., Sereni, J.S.: Characterization of graphs and digraphs with small process number. Research Report 6285, INRIA (2007)"},{"key":"37_CR10","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J. Assoc. Comput. Mach.\u00a035, 18\u201344 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"37_CR11","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, 345\u2013350 (1992)","journal-title":"Information Processing Letters"},{"key":"37_CR12","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"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92221-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T23:11:14Z","timestamp":1557961874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92221-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922209","9783540922216"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92221-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}