{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:42:36Z","timestamp":1742380956207},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540680390"},{"type":"electronic","value":"9783540680406"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11945918_23","type":"book-chapter","created":{"date-parts":[[2006,12,17]],"date-time":"2006-12-17T22:09:45Z","timestamp":1166393385000},"page":"193-204","source":"Crossref","is-referenced-by-count":2,"title":["Capturing an Intruder in Product Networks"],"prefix":"10.1007","author":[{"given":"Navid","family":"Imani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Sarbazi-Azad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Zomaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraignaud, P., Santoro, N.: Capture of an intruder by mobile agents. In: Proc. 14th ACM Symposium on Parallel Algorithms and Architectures (SPAA), Winnipeg, Manitoba, Canada, pp. 200\u2013209 (2002)","DOI":"10.1145\/564870.564906"},{"key":"23_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\u00e8re","year":"2003","unstructured":"Barri\u00e8re, L., Fraigniaud, P., Santoro, N., Thilikos, D.M.: Searching is not jumping. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 34\u201345. Springer, Heidelberg (2003)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Day, K., Al-Ayyoub, A.: Minimal Fault Diameter of Highly resilient Product Networks. IEEE Trans. On Parallel and Distributed Systems\u00a011(9) (September 2000)","DOI":"10.1109\/71.879775"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45032-7_1","volume-title":"Self-Stabilizing Systems","author":"M. Demirbas","year":"2003","unstructured":"Demirbas, M., Arora, A., Gouda, M.G.: A Pursuer-Evader Game for Sensor Networks. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol.\u00a02704, pp. 1\u201316. Springer, Heidelberg (2003)"},{"issue":"7","key":"23_CR5","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1109\/71.707541","volume":"9","author":"V.V. Dimakopoulos","year":"1998","unstructured":"Dimakopoulos, V.V., Dimopolulos, N.J.: A Theory for Total Exchange in Multidimensional Interconnection Networks. IEEE Trans. Parallel and Distributed Systems\u00a09(7), 639\u2013649 (1998)","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"12","key":"23_CR6","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1109\/71.640013","volume":"8","author":"A. Fernandez","year":"1997","unstructured":"Fernandez, A., Efe, K.: Generalized Algorithm for Parallel Sorting on Product Networks. IEEE Trans. Parallel and Distributed Systems\u00a08(12), 1211\u20131225 (1997)","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"10","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1109\/12.628392","volume":"46","author":"A. Fernandez","year":"1997","unstructured":"Fernandez, A., Efe, K.: Efficient VLSI Layouts for Homogeneous Product Networks. IEEE Trans. Computers\u00a046(10), 1070\u20131082 (1997)","journal-title":"IEEE Trans. Computers"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous search in the hypercube for capturing an intruder. In: Proc. 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Denver, Colorado (2005)","DOI":"10.1109\/IPDPS.2005.151"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Harary, F.: On the Group of the Composition of Two Graphs. Duke Math. J.\u00a026 (1959)","DOI":"10.1215\/S0012-7094-59-02603-1"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00373-004-0586-8","volume":"21","author":"M.A. Henning","year":"2005","unstructured":"Henning, M.A., Rall, R.: On the Total Domination Number of Cartesian Products of Graphs. Graphs and Combinatorics\u00a021, 63\u201369 (2005)","journal-title":"Graphs and Combinatorics"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Imani, N., Sarbazi-Azad, H., Zomaya, A.Y.: Intrusion capturing in product networks, Technical Report TR-3-2006, IPM, School of Computer Science, Tehran, Iran (March 2006)","DOI":"10.1007\/11945918_23"},{"issue":"1-3","key":"23_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0012-365X(01)00312-0","volume":"247","author":"S. Klavzar","year":"2002","unstructured":"Klavzar, S., Yeh, H.: On the fractional chromatic number, the chromatic number, and graph products. Discrete Mathematics\u00a0247(1-3), 235\u2013242 (2002)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0012-365X(94)00377-U","volume":"155","author":"S. Klavzar","year":"1996","unstructured":"Klavzar, S.: Coloring graph products \u2013 A survey. Discrete Mathematics\u00a0155(1), 135\u2013145 (1996)","journal-title":"Discrete Mathematics"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Ku, S., Wang, B., Hung, T.: Constructing Edge-Disjoint Spanning Trees in Product Networks. IEEE Transaction on Parallel And Distributed Systems\u00a014(3) (March 2003)","DOI":"10.1109\/TPDS.2003.1189580"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s004530010026","volume":"27","author":"S. Peng","year":"2000","unstructured":"Peng, S., Ko, M., Ho, C., Hsu, T., Tang, C.: Graph searching on Chordal graphs. Algorithmica\u00a027, 395\u2013426 (2000)","journal-title":"Algorithmica"},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.ipl.2004.11.005","volume":"93","author":"M. Xu","year":"2005","unstructured":"Xu, M., Xu, J.-M., Hou, X.-M.: Fault diameter of Cartesian product graphs. Information Processing Letters\u00a093, 245\u2013248 (2005)","journal-title":"Information Processing Letters"},{"key":"23_CR17","unstructured":"Yospanya, P., Laekhanukit, B., Nanongkai, D., Fakcharoenphol, J.: Detecting and cleaning intruders in sensor networks. In: Proceedings of the National Comp. Sci. and Eng. Conf. (NCSEC 2004) (2004)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing - HiPC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11945918_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:18:28Z","timestamp":1619507908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11945918_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540680390","9783540680406"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11945918_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}