{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T06:12:22Z","timestamp":1774764742917,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4794,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1016\/s0304-3975(99)00241-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:46:25Z","timestamp":1027637185000},"page":"429-446","source":"Crossref","is-referenced-by-count":20,"title":["Edge and node searching problems on trees"],"prefix":"10.1016","volume":"240","author":[{"given":"Sheng-Lung","family":"Peng","sequence":"first","affiliation":[]},{"given":"Chin-Wen","family":"Ho","sequence":"additional","affiliation":[]},{"given":"Tsan-sheng","family":"Hsu","sequence":"additional","affiliation":[]},{"given":"Ming-Tat","family":"Ko","sequence":"additional","affiliation":[]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00241-8_BIB1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0608024","article-title":"Complexity of finding embeddings in a k-tree","volume":"8","author":"Arnborg","year":"1987","journal-title":"SIAM J. Algebra Discrete Meth."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB2","doi-asserted-by":"crossref","unstructured":"D. Bienstock, Graph searching, path-width, tree-width and related problems (a survey), in: F. Roberts, F. Hwang, C. Monma (Eds.), Reliability of Computer and Communication Networks, DIMACS series in Disc. Math. and Theoretical Comp. Scie., Vol. 5, American Math. Society, Providence, RI, 1991, pp. 33\u201349.","DOI":"10.1090\/dimacs\/005\/02"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB3","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/S089548019223992X","article-title":"Treewidth and pathwidth of permutation graphs","volume":"8","author":"Bodlaender","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB4","series-title":"Treewidth and minimum fill-in on d-trapezoid graphs, Technical Report UU-CS-1995-34, Department of Computer Science","author":"Bodlaender","year":"1995"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB5","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1006\/jagm.1996.0049","article-title":"Efficient and constructive algorithms for the pathwidth and treewidth of graphs","volume":"21","author":"Bodlaender","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0406014","article-title":"The pathwidth and treewidth of cographs","volume":"6","author":"Bodlaender","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","article-title":"Monotonicity in graph searching","volume":"12","author":"Bienstock","year":"1991","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB8","series-title":"Introduction to Algorithms","author":"Cormen","year":"1992"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB9","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/0214013","article-title":"Polynomial time algorithms for the min cut problem on degree restricted trees","volume":"14","author":"Chung","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB10","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1006\/inco.1994.1064","article-title":"The vertex separation and search number of a graph","volume":"113","author":"Ellis","year":"1994","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB11","unstructured":"P.A. Golovach, Extremal searching problems on graphs, Ph.D. thesis, Leningrad, 1990 (in Russian)."},{"issue":"1","key":"10.1016\/S0304-3975(99)00241-8_BIB12","first-page":"88","article-title":"Search number, node search number, and vertex separator of a graph","volume":"24","author":"Golovach","year":"1991","journal-title":"Vestn. Leningr. Univ., Math."},{"issue":"4","key":"10.1016\/S0304-3975(99)00241-8_BIB13","first-page":"15","article-title":"The search number of a complete graph","volume":"19","author":"Golovach","year":"1986","journal-title":"Vestn. Leningr. Univ., Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB14","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0166-218X(93)90012-D","article-title":"On the pathwidth of chordal graphs","volume":"45","author":"Gustedt","year":"1993","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB15","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","article-title":"interval graph and searching","volume":"55","author":"Kirousis","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","article-title":"searching and pebbling","volume":"47","author":"Kirousis","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB17","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0020-0190(92)90234-M","article-title":"The vertex separation number of a graph equals its path-width","volume":"42","author":"Kinnersley","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB18","doi-asserted-by":"crossref","unstructured":"T. Kloks, Treewidth \u2014 Computations and Applications, Lecture Notes in Computer Sciense, Vol. 842, Springer, Berlin, 1994.","DOI":"10.1007\/BFb0045375"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB19","doi-asserted-by":"crossref","unstructured":"T. Kloks, H. Bodlaender, H. M\u00fcller, D. Kratsch, Computing treewidth and minimum fill-in: all you need are the minimal separators, ESA\u201993, Lecture Notes in Computer Sciense, Vol. 726, pp. 260\u2013271, 1993. Erratum: ESA\u201994, Lecture Notes in Computer Sciense, Vol. 855, pp. 508, 1994.","DOI":"10.1007\/BFb0049435"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(92)90208-R","article-title":"Narrowness, pathwidth, and their application in natural language processing","volume":"36","author":"Kornai","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB21","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","article-title":"Recontamination does not help to search a graph","volume":"40","author":"LaPaugh","year":"1993","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB22","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0606044","article-title":"Topological bandwidth","volume":"6","author":"Makedon","year":"1985","journal-title":"SIAM J. Algebra Discrete Meth."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB23","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(89)90016-4","article-title":"On minimizing width in linear layouts","volume":"23","author":"Makedon","year":"1989","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB24","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/42267.42268","article-title":"The complexity of searching a graph","volume":"35","author":"Megiddo","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB25","series-title":"Computational Graph Theory","first-page":"17","article-title":"Graph problems related to gate matrix layout and PLA folding","author":"M\u00f6hring","year":"1990"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB26","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(88)90028-X","article-title":"Min cut is NP-complete for edge weighted trees","volume":"58","author":"Monien","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB27","series-title":"Theory and Applications of Graphs","first-page":"426","article-title":"Pursuit-evasion in a graph","author":"Parsons","year":"1976"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB28","unstructured":"T.D. Parsons, The search number of a connected graph, Proc. 9th S-E Conf. on Combinatorics, Graph Theory, and Computing, 1978, pp. 549\u2013554."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB29","unstructured":"S.L. Peng, C.W. Ho, T.-s. Hsu, M.T. Ko, C.Y. Tang, Edge and node searching problems on trees, Technical Report TR-IIS-98-015, Institute of Information Science, Academia Sinica, Taiwan, 1998 (ftp.iis.sinica.edu.tw)."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB30","doi-asserted-by":"crossref","unstructured":"S.L. Peng, M.T. Ko, C.W. Ho, T.-s. Hsu, C.Y. Tang, Graph searching on chordal graphs, ISAAC\u201996, Lecture Notes in Computer Science, Vol. 1178, pp. 156\u2013165, 1996.","DOI":"10.1007\/BFb0009491"},{"issue":"8","key":"10.1016\/S0304-3975(99)00241-8_BIB31","first-page":"1345","article-title":"Pursuit problems without information about the evader","volume":"18","author":"Petrov","year":"1982","journal-title":"Differents. Uravn."},{"issue":"3","key":"10.1016\/S0304-3975(99)00241-8_BIB32","first-page":"66","article-title":"Minimal graphs with a search number less than four","volume":"22","author":"Petrov","year":"1989","journal-title":"Vestn. Leningr. Univ., Math."},{"key":"10.1016\/S0304-3975(99)00241-8_BIB33","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","article-title":"Graph minors I. Excluding a forest","volume":"35","author":"Robertson","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB34","series-title":"Topics in Combinatorics and Graph Theory","first-page":"613","article-title":"A linear algorithm for the pathwidth of trees","author":"Scheffler","year":"1990"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB35","first-page":"287","article-title":"Optimal embedding of a tree into an interval graph in linear time, Fourth Czechoslovakian Symposium on Combinatorics, Graphs and Complexity","volume":"Vol. 51","author":"Scheffler","year":"1992"},{"key":"10.1016\/S0304-3975(99)00241-8_BIB36","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","article-title":"A polynomial algorithm for the min cut linear arrangement of trees","volume":"32","author":"Yannakakis","year":"1988","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002418?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599002418?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T23:49:30Z","timestamp":1580860170000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599002418"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["S0304397599002418"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00241-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}