{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T13:22:54Z","timestamp":1725974574466},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319901039"},{"type":"electronic","value":"9783319901046"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90104-6_3","type":"book-chapter","created":{"date-parts":[[2018,4,17]],"date-time":"2018-04-17T16:53:22Z","timestamp":1523984002000},"page":"39-47","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Cooperative Graph Searching Problem"],"prefix":"10.1007","author":[{"given":"Chin-Fu","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Navr\u00e1til","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,18]]},"reference":[{"issue":"5","key":"3_CR1","first-page":"72","volume":"6","author":"R Breisch","year":"1967","unstructured":"Breisch, R.: An intuitive approach to speleotopology. Southwest. Cavers 6(5), 72\u201379 (1967)","journal-title":"Southwest. Cavers"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0070400","volume-title":"Theory and Applications of Graphs","author":"T Parsons","year":"1976","unstructured":"Parsons, T.: Pursuit-evasion in a graph. In: Alavi, Y., Lick, D.R. (eds.) Theory and Applications of Graphs, pp. 426\u2013441. Springer, Heidelberg (1976). https:\/\/doi.org\/10.1007\/BFb0070400"},{"key":"3_CR3","unstructured":"Parsons, T.: The search number of a connected graph. In: Proceedings of the 9th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 549\u2013554 (1978)"},{"key":"3_CR4","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. Theor. Comput. Sci. 137, 253\u2013268 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR5","unstructured":"Cole, R., Hariharan, R., Indyk, P.: Tree pattern matching and subset matching in deterministic $$O(n \\log ^3 n)$$O(nlog3n)-time. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithm, pp. 245\u2013254 (1999)"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1145\/322290.322295","volume":"29","author":"C Hoffman","year":"1982","unstructured":"Hoffman, C., O\u2019Donnell, J.: Pattern matching in trees. J. ACM 29, 68\u201395 (1982)","journal-title":"J. ACM"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1613\/jair.43","volume":"1","author":"D Cook","year":"1993","unstructured":"Cook, D., Holder, L.: Substructure discovery using minimum description length and background knowledge. J. Artif. Intell. Res. 1, 231\u2013255 (1993)","journal-title":"J. Artif. Intell. Res."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/69.617051","volume":"9","author":"S Djoko","year":"1997","unstructured":"Djoko, S., Cook, D., Holder, L.: An empirical study of domain knowledge and its benefits to substructure discovery. IEEE Trans. Knowl. Data Eng. 9, 575\u2013586 (1997)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Chen, Z., Korn, F., Koudas, N., Muthukrishnan, S.: Selectivity estimation for Boolean queries. In: Proceedings of the ACM SIGMOD-SIGACT-SIGART Sympasium on Principles of Database Systems, pp. 216\u2013225 (2000)","DOI":"10.1145\/335168.335225"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1109\/34.211474","volume":"15","author":"H Almohamad","year":"1993","unstructured":"Almohamad, H., Duffuaa, S.: A linear programming approach for the weighted graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 15, 522\u2013525 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1109\/34.400565","volume":"17","author":"W Christmas","year":"1995","unstructured":"Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 17, 749\u2013764 (1995)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1137\/0214013","volume":"14","author":"M Chung","year":"1985","unstructured":"Chung, M., Makedon, F., Sudborough, I., Turner, J.: Polynomial time algorithm for the min cut problem on degree restricted trees. SAIM J. Comput. 14, 158\u2013177 (1985)","journal-title":"SAIM J. Comput."},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-40450-4_16","volume-title":"Algorithms \u2013 ESA 2013","author":"L Blin","year":"2013","unstructured":"Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 181\u2013192. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40450-4_16"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.ic.2016.11.007","volume":"252","author":"E Markou","year":"2017","unstructured":"Markou, E., Nisse, N., P\u00e9rennes, S.: Exclusive graph searching vs pathwidth. Inf. Comput. 252, 243\u2013260 (2017)","journal-title":"Inf. Comput."},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-68880-8_15","volume-title":"Algorithmic Aspects in Information and Management","author":"D Dyer","year":"2008","unstructured":"Dyer, D., Yang, B., Ya\u015far, \u00d6.: On the fast searching problem. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 143\u2013154. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68880-8_15"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.dam.2017.03.003","volume":"224","author":"Y Xue","year":"2017","unstructured":"Xue, Y., Yang, B.: The fast search number of a Cartesian product of graphs. Discrete Appl. Math. 224, 106\u2013119 (2017)","journal-title":"Discrete Appl. Math."},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A LaPaugh","year":"1993","unstructured":"LaPaugh, A.: Recontamination does not help to search a graph. J. ACM 40, 224\u2013245 (1993)","journal-title":"J. ACM"},{"key":"3_CR18","first-page":"523","volume":"407","author":"B Yang","year":"2008","unstructured":"Yang, B., Cao, Y.: Monotonicity in digraph search problems. Theor. Comput. Sci. 407, 523\u2013544 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF02996932","volume":"38","author":"F Escalante","year":"1972","unstructured":"Escalante, F.: Schnittverb\u00e4nde in graphen. Abh. Math. Semin. Univ. Hambg. 38, 199\u2013220 (1972)","journal-title":"Abh. Math. Semin. Univ. Hambg."}],"container-title":["Lecture Notes in Computer Science","Structured Object-Oriented Formal Language and Method"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90104-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T02:48:57Z","timestamp":1571194137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-90104-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319901039","9783319901046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90104-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}