{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:17:59Z","timestamp":1725459479666},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633570"},{"type":"electronic","value":"9783540695226"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0045095","type":"book-chapter","created":{"date-parts":[[2006,2,6]],"date-time":"2006-02-06T09:16:11Z","timestamp":1139217371000},"page":"284-293","source":"Crossref","is-referenced-by-count":1,"title":["Edge and node searching problems on trees"],"prefix":"10.1007","author":[{"given":"Sheng-Lung","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Wen","family":"Ho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsan-sheng","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming-Tat","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan-Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,1,24]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"S. Arnborg, D.C. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth., 8 (1987), 277\u2013284.","journal-title":"SIAM J. Alg. Disc. Meth."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","volume":"21","author":"H.L. Bodlaender","year":"1996","unstructured":"H.L. Bodlaender and T. Kloks, Efficient and constructive algorithms for the path-width and treewidth of graphs, J. Algorithms, 21 (1996), 358\u2013402.","journal-title":"J. Algorithms"},{"key":"30_CR3","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-56939-1_66","volume":"700","author":"H.L. Bodlaender","year":"1993","unstructured":"H.L. Bodlaender, T. Kloks, and D. Kratsch, Treewidth and pathwidth of permutation graphs, ICALP'93, Lecture Notes in Computer Science, 700, 114\u2013125, 1993.","journal-title":"ICALP'93, Lecture Notes in Computer Science"},{"key":"30_CR4","series-title":"Technical Report UU-CS-1995-34","volume-title":"Treewidth and minimum fill-in on d-trapezoid graphs","author":"H. L. Bodlaender","year":"1995","unstructured":"H. L. Bodlaender, T. Kloks, D. Kratsch, and H. Muller, Treewidth and minimum fill-in on d-trapezoid graphs, Technical Report UU-CS-1995-34, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1995."},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","volume":"6","author":"H.L. Bodlaender","year":"1993","unstructured":"H.L. Bodlaender and R.H. M\u00f6hring, The pathwidth and treewidth of cographs, SIAM J. Disc. Math., 6 (1993), 181\u2013188.","journal-title":"SIAM J. Disc. Math."},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"D. Bienstock and P. Seymour, Monotonicity in graph searching, J. Algorithms, 12 (1991), 239\u2013245.","journal-title":"J. Algorithms"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/0214013","volume":"14","author":"M.-J. Chung","year":"1985","unstructured":"M.-J. Chung, F. Makedon, I.H. Sudborough, and J. Turner, Polynomial time algorithms for the min cut problem on degree restricted trees, SIAM J. Comput., 14 (1985), 158\u2013177.","journal-title":"SIAM J. Comput."},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1994.1064","volume":"113","author":"J.A. Ellis","year":"1994","unstructured":"J.A. Ellis, I.H. Sudborough, and J.S. Turner, The vertex separation and search number of a graph, Information and Computation, 113 (1994), 50\u201379.","journal-title":"Information and Computation"},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(93)90012-D","volume":"45","author":"J. Gustedt","year":"1993","unstructured":"J. Gustedt, On the pathwidth of chordal graphs, Disc. Appl. Math., 45 (1993), 233\u2013248.","journal-title":"Disc. Appl. Math."},{"key":"30_CR10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-57273-2_61","volume":"726","author":"T. Kloks","year":"1993","unstructured":"T. Kloks, H. Bodlaender, H. Muller, and D. Kratsch, Computing treewidth and minimum fill-in: all you need are the minimal separators, ESA'93, Lecture Notes in Computer Sciense, 726, 260\u2013271, 1993. Erratum: ESA'94, Lecture Notes in Computer Sciense, 855, pp. 508, 1994.","journal-title":"ESA'93, Lecture Notes in Computer Sciense"},{"key":"30_CR11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"L.M. Kirousis","year":"1985","unstructured":"L.M. Kirousis and C.H. Papadimitriou, Interval graph and searching, Disc. Math., 55 (1985), 181\u2013184.","journal-title":"Disc. Math."},{"key":"30_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L.M. Kirousis","year":"1986","unstructured":"L.M. Kirousis and C.H. Papadimitriou, Searching and pebbling, Theoretical Comput. Scie., 47 (1986), 205\u2013218.","journal-title":"Theoretical Comput. Scie."},{"key":"30_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(92)90208-R","volume":"36","author":"A. Kornai","year":"1992","unstructured":"A. Kornai and Z. Tuza, Narrowness, pathwidth, and their application in natural language processing, Disc. Appl. Math., 36 (1992), 87\u201392.","journal-title":"Disc. Appl. Math."},{"key":"30_CR14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","volume":"42","author":"N.G. Kinnersley","year":"1992","unstructured":"N.G. Kinnersley, The vertex separation number of a graph equals its path-width, Inform. Process. Lett., 42 (1992), 345\u2013350.","journal-title":"Inform. Process. Lett."},{"key":"30_CR15","volume-title":"Treewidth","author":"T. Kloks","year":"1993","unstructured":"T. Kloks, Treewidth, Ph.D. Thesis, Utrecht University, The Netherlands, 1993."},{"key":"30_CR16","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A.S. LaPaugh","year":"1993","unstructured":"A.S. LaPaugh, Recontamination does not help to search a graph, J. Assoc. Comput. Mach., 40 (1993), 224\u2013245.","journal-title":"J. Assoc. Comput. Mach."},{"key":"30_CR17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, S.L. Hakimi, M.R. Garey, D.S. Johnson, and C.H. Papadimitriou, The complexity of searching a graph, J. Assoc. Comput. Mach., 35 (1988), 18\u201344.","journal-title":"J. Assoc. Comput. Mach."},{"key":"30_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","volume":"23","author":"F. Makedon","year":"1989","unstructured":"F. Makedon and I.H. Sudborough, On minimizing width in linear layouts, Disc. Appl. Math., 23 (1989), 243\u2013265.","journal-title":"Disc. Appl. Math."},{"key":"30_CR19","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-7091-9076-0_2","volume-title":"Computational Graph Theory","author":"R.H. M\u00f6hring","year":"1990","unstructured":"R.H. M\u00f6hring, Graph problems related to gate matrix layout and PLA folding, in: G. Tinnhofer et al., eds., Computational Graph Theory (Springer, Wien, 1990), 17\u201332."},{"key":"30_CR20","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","volume":"58","author":"B. Monien","year":"1988","unstructured":"B. Monien and I.H. Sudborough, Min cut is NP-complete for edge weighted trees, Theoretical Comput. Scie., 58 (1988), 209\u2013229.","journal-title":"Theoretical Comput. Scie."},{"key":"30_CR21","first-page":"426","volume-title":"Theory and applications of graphs","author":"T.D. Parsons","year":"1976","unstructured":"T.D. Parsons, Pursuit-evasion in a graph, in Y. Alavi and D.R. Lick, eds., Theory and applications of graphs, Springer-Verlag, New York, 1976, 426\u2013441."},{"key":"30_CR22","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BFb0009491","volume":"1178","author":"S.L. Peng","year":"1996","unstructured":"S.L. Peng, M.T. Ko, C.W. Ho, T.-s. Hsu, and C.Y. Tang, Graph searching on chordal graphs, ISAAC'96, Lecture Notes in Computer Science, 1178, 156\u2013165, 1996.","journal-title":"ISAAC'96, Lecture Notes in Computer Science"},{"key":"30_CR23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"N. Robertson and P.D. Seymour, Graph minors I. Excluding a forest, J. Comb. Theory Ser. B, 35 (1983), 39\u201361.","journal-title":"J. Comb. Theory Ser. B"},{"key":"30_CR24","doi-asserted-by":"crossref","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":"P. Scheffler, A linear algorithm for the pathwidth of trees, in: R. Bodendiek and R. Henn, eds., Topics in Combinatorics and Graph Theory (Physica-Verlag, Heidelberg, 1990), 613\u2013620."},{"key":"30_CR25","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","volume":"32","author":"M. Yannakakis","year":"1988","unstructured":"M. Yannakakis, A polynomial algorithm for the min cut linear arrangement of trees, J. Assoc. Comput. Mach., 32 (1988), 950\u2013959.","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0045095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T09:23:43Z","timestamp":1549704223000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0045095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633570","9783540695226"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/bfb0045095","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}