复杂网络中的搜索：一种新的搜索方法
Search in Complex Networks : a New Method of Naming
摘要：
我们提出了一种方法，路由时，源不完全信息的最短路径到目的地。该方法对无标度网络特别有用，并利用了其独特的特性。通过为节点分配新的（短）名称（又名标签），我们能够显著降低路由器的内存需求，但我们成功地通过距离最短的路径进行高概率路由。
英文摘要：
We suggest a method for routing when the source does not posses full information about the shortest path to the destination. The method is particularly useful for scale-free networks, and exploits its unique characteristics. By assigning new (short) names to nodes (aka labelling) we are able to reduce significantly the memory requirement at the routers, yet we succeed in routing with high probability through paths very close in distance to the shortest ones.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
