{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:40:32Z","timestamp":1740109232850,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T00:00:00Z","timestamp":1454284800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00453-016-0124-0","type":"journal-article","created":{"date-parts":[[2016,2,1]],"date-time":"2016-02-01T14:54:17Z","timestamp":1454338457000},"page":"942-969","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Exclusive Graph Searching"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0342-9243","authenticated-orcid":false,"given":"L\u00e9lia","family":"Blin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janna","family":"Burman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,1]]},"reference":[{"key":"124_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2012.08.004","volume":"219","author":"L Barri\u00e8re","year":"2012","unstructured":"Barri\u00e8re, L., Flocchini, P., Fomin, F.V., Fraigniaud, P., Nisse, N., Santoro, N., Thilikos, D.M.: Connected graph searching. Inf. Comput. 219, 1\u201316 (2012)","journal-title":"Inf. Comput."},{"key":"124_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/dimacs\/005\/02","volume":"5","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser. Discret Math. Theor. Comput. Sci. 5, 33\u201349 (1991)","journal-title":"DIMACS Ser. Discret Math. Theor. Comput. Sci."},{"issue":"2","key":"124_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.D.: Monotonicity in graph searching. J. Algorithms 12(2), 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"key":"124_CR4","doi-asserted-by":"crossref","unstructured":"Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. In: 21st Annual European Symposium on Algorithms (ESA), vol. 8125 of Lecture Notes in Computer Science, pp. 181\u2013192. Springer (2013)","DOI":"10.1007\/978-3-642-40450-4_16"},{"key":"124_CR5","first-page":"72","volume":"6","author":"RL Breisch","year":"1967","unstructured":"Breisch, R.L.: An intuitive approach to speleotopology. Southwest. Cavers 6, 72\u201378 (1967)","journal-title":"Southwest. Cavers"},{"key":"124_CR6","volume-title":"Lost in a Cave-Applying Graph Theory to Cave Exploration","author":"RL Breisch","year":"2012","unstructured":"Breisch, R.L.: Lost in a Cave-Applying Graph Theory to Cave Exploration. National Speleological Society, Alabama (2012)"},{"issue":"4","key":"124_CR7","doi-asserted-by":"crossref","first-page":"1709","DOI":"10.1137\/110826424","volume":"26","author":"D Dereniowski","year":"2012","unstructured":"Dereniowski, D.: From pathwidth to connected pathwidth. SIAM J. Discrete Math. 26(4), 1709\u20131732 (2012)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"124_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"JA Ellis","year":"1994","unstructured":"Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Inf. Comput. 113(1), 50\u201379 (1994)","journal-title":"Inf. Comput."},{"issue":"3","key":"124_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1002\/net.20373","volume":"56","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Heggernes, P., Mihai, R.: Mixed search number and linear-width of interval and split graphs. Networks 56(3), 207\u2013214 (2010)","journal-title":"Networks"},{"issue":"3","key":"124_CR10","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/j.tcs.2008.02.040","volume":"399","author":"FV Fomin","year":"2008","unstructured":"Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236\u2013245 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"124_CR11","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1016\/j.dam.2011.04.020","volume":"160","author":"PA Golovach","year":"2012","unstructured":"Golovach, P.A., Heggernes, P., Mihai, R.: Edge search number of cographs. Discrete Appl. Math. 160(6), 734\u2013743 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"124_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"LM Kirousis","year":"1986","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoret. Comput. Sci. 47(2), 205\u2013218 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"124_CR13","unstructured":"Markou, E., Nisse, N., P\u00e9rennes, S.: Exclusive Graph Searching vs. Pathwidth. Research Report RR-8523, INRIA (2014)"},{"issue":"1","key":"124_CR14","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. 35(1), 18\u201344 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"124_CR15","unstructured":"Parsons, T.D.: The search number of a connected graph. In: 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congress. Numer., XXI, pp. 549\u2013554, Winnipeg. Utilitas Math (1978)"},{"issue":"2","key":"124_CR16","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1016\/S0304-3975(99)00241-8","volume":"240","author":"S-L Peng","year":"2000","unstructured":"Peng, S.-L., Ho, C.-W., Hsu, T-s, Ko, M.-T., Tang, C.Y.: Edge and node searching problems on trees. Theoret. Comput. Sci. 240(2), 429\u2013446 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"124_CR17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/S0196-6774(02)00225-0","volume":"47","author":"K Skodinis","year":"2003","unstructured":"Skodinis, K.: Computing optimal linear layouts of trees in linear time. J. Algorithms 47(1), 40\u201359 (2003)","journal-title":"J. Algorithms"},{"key":"124_CR18","doi-asserted-by":"crossref","unstructured":"Suchan, K., Todinca, I.: Pathwidth of circular-arc graphs. In: 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol. 4769 of LNCS, pp. 258\u2013269. Springer (2007)","DOI":"10.1007\/978-3-540-74839-7_25"},{"issue":"18","key":"124_CR19","doi-asserted-by":"crossref","first-page":"5770","DOI":"10.1016\/j.disc.2008.05.033","volume":"309","author":"B Yang","year":"2009","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number. Discrete Math. 309(18), 5770\u20135780 (2009)","journal-title":"Discrete Math."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0124-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-016-0124-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0124-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-016-0124-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:23Z","timestamp":1559072843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-016-0124-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,1]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s00453-016-0124-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2016,2,1]]}}}