{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:30:07Z","timestamp":1778301007607,"version":"3.51.4"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1016688707365","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T18:09:18Z","timestamp":1041185358000},"page":"99-112","source":"Crossref","is-referenced-by-count":13,"title":["Vertex-Ant-Walk \u2013 A robust method for efficient exploration of faulty graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Vladimir","family":"Yanovski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Israel A.","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred M.","family":"Bruckstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"336383_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1086\/285418","volume":"140","author":"F.R. Adler","year":"1992","unstructured":"F.R. Adler and D.M. Gordon, Information collection and spread by networks of patrolling ants, The American Naturalist 140(3) (1992) 373-400.","journal-title":"The American Naturalist"},{"key":"336383_CR2","doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lov\u00e1sz and C. Rackoff, Random walks, universal traversal sequencs and the complexity of mave problems, in: Proceedings of the 20th Annual Symposium on Foundation of Computer Science (1979) pp. 218-223.","DOI":"10.1109\/SFCS.1979.34"},{"key":"336383_CR3","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even, Graph Algorithms (Addisson-Wesley, Reading, MA, 1979)."},{"key":"336383_CR4","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/0003-3472(95)80100-6","volume":"50","author":"D.M. Gordon","year":"1995","unstructured":"D.M. Gordon, The expandable network of ant exploration, Animal Behaviour 50 (1995) 372-378.","journal-title":"Animal Behaviour"},{"key":"336383_CR5","unstructured":"K. Knight, Are many reactive agents better than a few deliberative ones, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (1993) pp. 432-437."},{"key":"336383_CR6","unstructured":"S. Koenig, B. Szymanski and Y. Liu, Efficient and inefficient ant coverage methods, Annals of Mathematics and Artificial Intelligence, Special Issue on Ant Robotics (2001)."},{"key":"336383_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0004-3702(90)90054-4","volume":"42","author":"R.E. Korf","year":"1992","unstructured":"R.E. Korf, Real-time heuristic search, Artificial Intelligence 42 (1992) 189-211.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"336383_CR8","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1(2) (1972) 146-160.","journal-title":"SIAM J. Comput."},{"key":"336383_CR9","unstructured":"G. Tarry, Le probleme des labyrinths, Nouvelles Annales de Mathematiques 14(187) (1895)."},{"key":"336383_CR10","unstructured":"I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Smell as a computational resourse-A lesson we can learn from the ants, in: Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems (ISTCS), Jerusalem, June 10-11, 1996, pp. 219-230."},{"key":"336383_CR11","unstructured":"I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, On-line graph searching by a smell-oriented vertex process, in: AAAI-97 Workshop on On-Line Search, Providence, RI (28 July 1997)."},{"issue":"16","key":"336383_CR12","first-page":"915","volume":"8","author":"I.A. Wagner","year":"2000","unstructured":"I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, ANTS: Agents on Networks, Trees and Subgraphs, Future Generation Computer Systems, Special Issue on Ant Colony Optimization 8(16) (2000) 915-926.","journal-title":"Special Issue on Ant Colony Optimization"},{"key":"336383_CR13","unstructured":"V.M. Yanovski, I.A. Wagner and A.M. Bruckstein, Distributed ant algorithm for efficiently patrolling a network, in: Proceedings of ANTS'2000, Bruxelles, Belgium (September 2000) pp. 152-155."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016688707365.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016688707365\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016688707365.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:43:28Z","timestamp":1747547008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016688707365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":13,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["336383"],"URL":"https:\/\/doi.org\/10.1023\/a:1016688707365","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}