Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs
暂无分享,去创建一个
[1] Israel A. Wagner,et al. On-Line Graph Searching by a Smell-Oriented Vertex Process , 1997 .
[2] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Shimon Even,et al. Graph Algorithms , 1979 .
[4] Boleslaw K. Szymanski,et al. E cient and ine cient ant coverage methods , 2001 .
[5] Israel A. Wagner,et al. A Distributed Ant Algorithm for\protect Efficiently Patrolling a Network , 2003, Algorithmica.
[6] Deborah M. Gordon,et al. The expandable network of ant exploration , 1995, Animal Behaviour.
[7] F R Adler,et al. Information Collection and Spread by Networks of Patrolling Ants , 1992, The American Naturalist.
[8] Richard E. Korf,et al. Real-Time Heuristic Search , 1990, Artif. Intell..
[9] Israel A. Wagner,et al. ANTS: Agents on Networks, Trees, and Subgraphs , 2000, Future Gener. Comput. Syst..
[10] Boleslaw K. Szymanski,et al. Efficient and inefficient ant coverage methods , 2001, Annals of Mathematics and Artificial Intelligence.
[11] Israel A. Wagner,et al. Smell as a Computational Resource - A Lesson We Can Learn from the Ant , 1996, ISTCS.
[12] Kevin Knight,et al. Are Many Reactive Agents Better Than a Few Deliberative Ones? , 1993, IJCAI.
[13] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..