{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:46:04Z","timestamp":1725497164490},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748380"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74839-7_29","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T14:55:58Z","timestamp":1196952958000},"page":"304-315","source":"Crossref","is-referenced-by-count":4,"title":["Mixed Search Number and Linear-Width of Interval and Split Graphs"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rodica","family":"Mihai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"International Series in Operations Research & Management Science","volume-title":"The theory of search games and rendezvous","author":"S. Alpern","year":"2003","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. International Series in Operations Research & Management Science, vol.\u00a055. Kluwer Academic Publishers, Boston, MA (2003)"},{"key":"29_CR2","series-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci.","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/dimacs\/005\/02","volume-title":"Reliability of computer and communication networks","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). In: Reliability of computer and communication networks. DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol.\u00a05, pp. 33\u201349. Amer. Math. Soc., Providence, RI (1991)"},{"key":"29_CR3","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. J. Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"J. Algorithms"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using pq-tree algorithms. J. Comp. Syst. Sc.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comp. Syst. Sc."},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11821069_24","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Cohen","year":"2006","unstructured":"Cohen, J., Fomin, F.V., Heggernes, P., Kratsch, D., Kucherov, G.: Optimal linear arrangement of interval graphs. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 267\u2013279. Springer, Heidelberg (2006)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Computing Surveys\u00a034, 313\u2013356 (2002)","journal-title":"ACM Computing Surveys"},{"issue":"2001","key":"29_CR7","first-page":"15","volume":"34","author":"F.V. Fomin","year":"2002","unstructured":"Fomin, F.V.: A generalization of the graph bandwidth. Vestnik St. Petersburg Univ. Math.\u00a034(2001), 15\u201319 (2002)","journal-title":"Vestnik St. Petersburg Univ. Math."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/j.jda.2005.06.004","volume":"4","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., Thilikos, D.M.: A 3-approximation for the pathwidth of halin graphs. J. Discrete Algorithms\u00a04, 499\u2013510 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","volume":"16","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C., Hoffman, A.J.: A characterization of comparability graphs and of interval graphs. Canad. J. Math.\u00a016, 539\u2013548 (1964)","journal-title":"Canad. J. Math."},{"key":"29_CR10","unstructured":"Golovach, P.A., Petrov, N.N.: Some generalizations of the problem on the search number of a graph. Vestn. St. Petersbg. Univ., Math.\u00a028(3), 18\u201322 (1995), Tanslation from Vestn. St-Peterbg. Univ., Ser. I, Mat. Mekh. Astron. 3,\u00a021\u201327 (1995)"},{"key":"29_CR11","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Annals of Discrete Mathematics, vol.\u00a057. Elsevier, Amsterdam (2004)","edition":"2"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(93)90012-D","volume":"45","author":"J. Gustedt","year":"1993","unstructured":"Gustedt, J.: On the pathwidth of chordal graphs. Disc. Appl. Math.\u00a045, 233\u2013248 (1993)","journal-title":"Disc. Appl. Math."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0012-365X(85)90046-9","volume":"55","author":"L.M. Kirousis","year":"1985","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Interval graphs and searching. Discrete Math.\u00a055, 181\u2013184 (1985)","journal-title":"Discrete Math."},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0403033","volume":"3","author":"D.J. Kleitman","year":"1990","unstructured":"Kleitman, D.J., Vohra, R.V.: Computing the bandwidth of interval graphs. SIAM J. Disc. Math.\u00a03, 373\u2013375 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.dam.2004.01.015","volume":"145","author":"T. Kloks","year":"2005","unstructured":"Kloks, T., Kratochv\u00edl, J., M\u00fcller, H.: Computing the branchwidth of interval graphs. Disc. Appl. Math.\u00a0145, 266\u2013275 (2005)","journal-title":"Disc. Appl. Math."},{"key":"29_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-40064-8_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"T. Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., Borgne, Y.L., M\u00fcller, H.: Bandwidth of split and circular permutation graphs. In: Brandes, U., Wagner, D. (eds.) WG 2000. LNCS, vol.\u00a01928, pp. 243\u2013254. Springer, Heidelberg (2000)"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A.S. LaPaugh","year":"1993","unstructured":"LaPaugh, A.S.: Recontamination does not help to search a graph. J. Assoc. Comput. Mach.\u00a040, 224\u2013245 (1993)","journal-title":"J. Assoc. Comput. Mach."},{"key":"29_CR18","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, 18\u201344 (1988)","journal-title":"J. Assoc. Comput. Mach."},{"key":"29_CR19","series-title":"LNCM","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. LNCM, vol.\u00a0642, pp. 426\u2013441. Springer, Heidelberg (1978)"},{"key":"29_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/11561071_35","volume-title":"Algorithms \u2013 ESA 2005","author":"C. Paul","year":"2005","unstructured":"Paul, C., Telle, J.A.: New tools and simpler algorithms for branchwidth. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 379\u2013390. Springer, Heidelberg (2005)"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1016\/j.dam.2005.09.010","volume":"154","author":"S.-L. Peng","year":"2006","unstructured":"Peng, S.-L., Chen, C.-K.: On the interval completion of chordal graphs. Discrete Appl. Math.\u00a0154, 1003\u20131010 (2006)","journal-title":"Discrete Appl. Math."},{"key":"29_CR22","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s004530010026","volume":"27","author":"S.-L. Peng","year":"2000","unstructured":"Peng, S.-L., Ko, M.-T., Ho, C.-W., Hsu, T.-s., Tang, C.Y.: Graph searching on some subclasses of chordal graphs. Algorithmica\u00a027, 395\u2013426 (2000)","journal-title":"Algorithmica"},{"key":"29_CR23","first-page":"1345","volume":"18","author":"N.N. Petrov","year":"1982","unstructured":"Petrov, N.N.: A problem of pursuit in the absence of information on the pursued. Differentsial\u2019nye Uravneniya\u00a018, 1345\u20131352, 1468 (1982)","journal-title":"Differentsial\u2019nye Uravneniya"},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(94)00160-K","volume":"137","author":"A. Takahashi","year":"1995","unstructured":"Takahashi, A., Ueno, S., Kajitani, Y.: Mixed searching and proper-path-width. Theoret. Comput. Sci.\u00a0137, 253\u2013268 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR25","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(00)00175-X","volume":"105","author":"D.M. Thilikos","year":"2000","unstructured":"Thilikos, D.M.: Algorithms and obstructions for linear-width and related search parameters. Discrete Appl. Math.\u00a0105, 239\u2013271 (2000)","journal-title":"Discrete Appl. Math."},{"key":"29_CR26","unstructured":"Thomas, R.: Tree-decompositions of graphs (lecture notes). School of Mathematics. Georgia Institute of Technology, Atlanta, Georgia 30332, USA (1996)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74839-7_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:42:35Z","timestamp":1619520155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74839-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540748380"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74839-7_29","relation":{},"subject":[]}}