{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:06:50Z","timestamp":1742378810316},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341666"},{"type":"electronic","value":"9783540341680"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_58","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T20:17:13Z","timestamp":1146169033000},"page":"580-590","source":"Crossref","is-referenced-by-count":9,"title":["Capturing an Intruder in the Pyramid"],"prefix":"10.1007","author":[{"given":"Pooya","family":"Shareghi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Navid","family":"Imani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Sarbazi-Azad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"58_CR1","unstructured":"Foukia, N., Hulaas, J.G., Harms, J.: Intrusion Detection with Mobile Agents. In: Proc. of the 11th Annual Conference of the Internet Society, INET 2001 (2001)"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Fraigniaud, P., Santoro, N.: Capture of an Intruder by Mobile Agents. In: Proc. of SPAA 2002, Winnipeg, Manitoba, Canada (2002)","DOI":"10.1145\/564870.564906"},{"key":"58_CR3","unstructured":"Asaka, M., Okazawa, S., Taguchi, A., Goto, S.: A method of tracing intruders by use of mobile agents. In: Proc. of the 9th Annual Conference of the Internet Society, INET 1999 (1999)"},{"key":"58_CR4","doi-asserted-by":"crossref","unstructured":"Helmer, G.G., Wong, J.S.K., Honavar, V., Miller, L.: Intelligent agents for intrusion detection. In: IEEE Information Technology Conference, pp. 121\u2013124 (1998)","DOI":"10.1109\/IT.1998.713396"},{"key":"58_CR5","volume-title":"Proc. 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS)","author":"P. Flocchini","year":"2005","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Contiguous Search in the Hyperdiamond for Capturing an Intruder. In: Proc. 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS), Denver, Colorado (2005)"},{"key":"58_CR6","first-page":"72","volume":"6","author":"R. Breisch","year":"1967","unstructured":"Breisch, R.: An intuitive approach to speleology. Southwestern Cavers\u00a06, 72\u201378 (1967)","journal-title":"Southwestern Cavers"},{"key":"58_CR7","first-page":"426","volume-title":"Theory and Applications of Graphs","author":"T.D. Parsons","year":"1976","unstructured":"Parsons, T.D.: Pursuit-evasion in a graph. In: Theory and Applications of Graphs, pp. 426\u2013441. Springer, Heidelberg (1976)"},{"key":"58_CR8","unstructured":"Parsons, T.D.: The search number of a connected graph. In: Proc. Ninth Southeastern Conf. Combinatorics, Graph Theory and Computing, Winnipeg. Congress, vol.\u00a0XXI, pp. 549\u2013554 (1978)"},{"key":"58_CR9","unstructured":"Alspach, B.: Searching and Sweeping Graphs: A Brief Survey. (September 2004), accessible at ww.dmi.unict.it\/combinatorics04\/documenti%20pdf\/alspach.pdf"},{"key":"58_CR10","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. Journal of Algorithms\u00a012, 239\u2013245 (1991)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"58_CR11","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1109\/12.743415","volume":"48","author":"F. Cao","year":"1999","unstructured":"Cao, F., Hsu, D.F.: Fault-tolerance properties of pyramid networks. IEEE Transactions on Computers\u00a048(1), 88\u201393 (1999)","journal-title":"IEEE Transactions on Computers"},{"key":"58_CR12","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(01)00149-1","volume":"80","author":"H. Sarbazi-Azad","year":"2001","unstructured":"Sarbazi-Azad, H., Ould-Khaoua, M., Mackenzie, L.M.: Algorithmic construction of Hamiltonians in pyramids. Information Processing Letters\u00a080, 75\u201379 (2001)","journal-title":"Information Processing Letters"},{"key":"58_CR13","unstructured":"Dingle, A., Sudborough, H.: Simulation of binary trees and x-trees on pyramid networks. In: Proc. IEEE Symp. on Parallel & Distributed Processing, May 1992, pp. 220\u2013229 (1992)"},{"key":"58_CR14","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann, San Francisco (1992)"},{"issue":"11","key":"58_CR15","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/71.250106","volume":"4","author":"J.F. Jenq","year":"1993","unstructured":"Jenq, J.F., Sahni, S.: Image Shrinking and Expanding on a Pyramid. IEEE Transactions On Parallel and Distributed Systems\u00a04(11), 1291\u20131296 (1993)","journal-title":"IEEE Transactions On Parallel and Distributed Systems"},{"issue":"1","key":"58_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"Megiddo, N., Hakimi, S., Garey, M., Johnson, D., Papadimitriou, C.: The complexity of searching a graph. Journal of the ACM\u00a035(1), 18\u201344 (1988)","journal-title":"Journal of the ACM"},{"key":"58_CR17","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.: 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)"},{"key":"58_CR18","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","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:03:50Z","timestamp":1619507030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11753728_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}