{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:09:52Z","timestamp":1725556192085},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131219"},{"type":"electronic","value":"9783642131226"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13122-6_14","type":"book-chapter","created":{"date-parts":[[2010,5,20]],"date-time":"2010-05-20T05:26:31Z","timestamp":1274333191000},"page":"121-132","source":"Crossref","is-referenced-by-count":1,"title":["Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem"],"prefix":"10.1007","author":[{"given":"Nathann","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Coudert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorian","family":"Mazauric","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Napole\u00e3o","family":"Nepomuceno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Breisch, R.L.: An intuitive approach to speleotopology. Southwestern Cavers VI(5), 72\u201378 (1967)","key":"14_CR1"},{"unstructured":"Cohen, N., Coudert, D., Mazauric, D., Nepomuceno, N., Nisse, N.: Tradeoffs when optimizing lightpaths reconfiguration in WDM networks. RR 7047, INRIA (2009)","key":"14_CR2"},{"key":"14_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)"},{"unstructured":"Coudert, D., Huc, F., Mazauric, D., Nisse, N., Sereni, J.-S.: Routing reconfiguration\/process number: Coping with two classes of services. In: 13th Conf. on Optical Network Design and Modeling, ONDM (2009)","key":"14_CR4"},{"unstructured":"Coudert, D., Perennes, S., Pham, Q.-C., Sereni, J.-S.: Rerouting requests in wdm networks. In: AlgoTel 2005, May 2005, pp. 17\u201320 (2005)","key":"14_CR5"},{"unstructured":"Coudert, D., Sereni, J.-S.: Characterization of graphs and digraphs with small process number. Research Report 6285, INRIA (September 2007)","key":"14_CR6"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/TCAD.1987.1270248","volume":"6","author":"N. Deo","year":"1987","unstructured":"Deo, N., Krishnamoorthy, S., Langston, M.A.: Exact and approximate solutions for the gate matrix layout problem. IEEE Tr. on Comp.-Aided Design\u00a06, 79\u201384 (1987)","journal-title":"IEEE Tr. on Comp.-Aided Design"},{"issue":"1","key":"14_CR8","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Information and Computation\u00a0113(1), 50\u201379 (1994)","journal-title":"Information and Computation"},{"issue":"3","key":"14_CR9","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. Theo. Comp. Sci.\u00a0399(3), 236\u2013245 (2008)","journal-title":"Theo. Comp. Sci."},{"key":"14_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"key":"14_CR11","volume-title":"Design of Reliable Communication Networks","author":"N. Jose","year":"2003","unstructured":"Jose, N., Somani, A.K.: Connection rerouting\/network reconfiguration. In: Design of Reliable Communication Networks. IEEE, Los Alamitos (2003)"},{"issue":"2","key":"14_CR12","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.H.: Searching and pebbling. Theoretical Comp. Sc.\u00a047(2), 205\u2013218 (1986)","journal-title":"Theoretical Comp. Sc."},{"issue":"1","key":"14_CR13","doi-asserted-by":"crossref","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(1), 18\u201344 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"14_CR14","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)"},{"issue":"1","key":"14_CR15","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. Comb. Th. Ser. B\u00a035(1), 39\u201361 (1983)","journal-title":"J. Comb. Th. Ser. B"},{"doi-asserted-by":"crossref","unstructured":"Solano, F.: Analyzing two different objectives of the WDM network reconfiguration problem. In: IEEE Global Communications Conference, Globecom (2009)","key":"14_CR16","DOI":"10.1109\/GLOCOM.2009.5426108"},{"unstructured":"Solano, F., Pi\u00f3ro, M.: A mixed-integer programing formulation for the lightpath reconfiguration problem. In: VIII Workshop on G\/MPLS Networks, WGN8 (2009)","key":"14_CR17"}],"container-title":["Lecture Notes in Computer Science","Fun with Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13122-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:46:13Z","timestamp":1558277173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13122-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131219","9783642131226"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13122-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}