用双筒望远镜探索匿名图
Anonymous Graph Exploration with Binoculars
摘要：
我们调查的网络探索的移动代理。众所周知，如果没有关于图的全局信息，除了图是树之外，不可能在探索之后使代理停止。因此，我们赋予代理与双筒望远镜，传感设备，可以显示在代理当前位置的恒定距离的环境的局部结构。我们表明，用双筒望远镜，有可能探索和停止在一个大类的非树网络。我们给出了一个完整的表征的网络类，可以探索使用双筒望远镜使用标准概念的离散拓扑结构。我们的特征是建设性的，我们提出了一个探索算法，是普遍的，该算法探讨任何网络可探索的双筒望远镜，从来没有停止在非可探索的网络。
英文摘要：
We investigate the exploration of networks by a mobile agent. It is long known that, without global information about the graph, it is not possible to make the agent halts after the exploration except if the graph is a tree. We therefore endow the agent with binoculars, a sensing device that can show the local structure of the environment at a constant distance of the agent current location. We show that, with binoculars, it is possible to explore and halt in a large class of non-tree networks. We give a complete characterization of the class of networks that can be explored using binoculars using standard notions of discrete topology. Our characterization is constructive, we present an Exploration algorithm that is universal; this algorithm explores any network explorable with binoculars, and never halts in non-explorable networks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
