{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T13:46:32Z","timestamp":1767015992141},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11682462_45","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"479-490","source":"Crossref","is-referenced-by-count":21,"title":["Connected Treewidth and Connected Graph Searching"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Nisse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Barri\u00e9re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 200\u2013209 (2002)","DOI":"10.1145\/564905.564906"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-540-39890-5_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. Barri\u00e9re","year":"2003","unstructured":"Barri\u00e9re, L., Fraigniaud, P., Santoro, N., Thilikos, D.: Connected and Internal Graph Searching. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 34\u201345. Springer, Heidelberg (2003)"},{"key":"45_CR3","doi-asserted-by":"publisher","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 Series in Discrete Mathematics and Theoretical Computer Science\u00a05, 33\u201349 (1991)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"45_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"issue":"5","key":"45_CR5","first-page":"72","volume":"VI","author":"R. Breisch","year":"1967","unstructured":"Breisch, R.: An intuitive approach to speleotopology. Southwestern Cavers\u00a0VI(5), 72\u201378 (1967)","journal-title":"Southwestern Cavers"},{"key":"45_CR6","first-page":"50","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, 50\u201379 (1994)","journal-title":"The Vertex Separation and Search Number of a Graph Information and computation"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Feige, U., Hajiaghayi, M., Lee, J.: Improved approximation algorithms for minimum-weight vertex separators. In: 37th ACM Symposium on Theory of Computing (STOC) (2005)","DOI":"10.1145\/1060590.1060674"},{"key":"45_CR8","unstructured":"Fomin, F., Fraigniaud, P., Thilikos, D.: The Price of Connectedness in Expansions. Technical Report LSI-04-28-R, UPC Barcelona (2004)"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Computer Science and Applied Mathematics (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"issue":"1","key":"45_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., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. Journal of the ACM\u00a035(1), 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0166-218X(97)00041-3","volume":"79","author":"A. Parra","year":"1997","unstructured":"Parra, A., Scheffler, P.: Characterizations and algorithmic applications of chordal graphe embeddings. Discrete Applied Mathematics\u00a079, 171\u2013188 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR12","series-title":"Lecture Notes in Mathematics","first-page":"426","volume-title":"Pursuit-evasion in a graph Theory and Applications of Graphs","author":"T. Parson","year":"1976","unstructured":"Parson, T.: Pursuit-evasion in a graph Theory and Applications of Graphs. Lecture Notes in Mathematics, pp. 426\u2013441. Springer, Heidelberg (1976)"},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors II, Algorithmic Aspects of Tree- Width. Journal of Algorithms\u00a07, 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N. Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors X, Obstructions to treedecomposition. Journal Combin. Theory B\u00a052, 153\u2013190 (1991)","journal-title":"Journal Combin. Theory B"},{"issue":"2","key":"45_CR15","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01215352","volume":"14","author":"P. Seymour","year":"1994","unstructured":"Seymour, P., Thomas, R.: Call routing and the rat-catcher. Combinatorica\u00a014(2), 217\u2013241 (1994)","journal-title":"Combinatorica"},{"key":"45_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1007\/978-3-540-30551-4_77","volume-title":"Algorithms and Computation","author":"B. Yang","year":"2004","unstructured":"Yang, B., Dyer, D., Alspach, B.: Sweeping Graphs with Large Clique Number. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 908\u2013920. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T20:18:29Z","timestamp":1555445909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11682462_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}