Abstract
We present a distributed self-adjusting algorithm for skip graphs that minimizes the average routing costs between arbitrary communication pairs by pe......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
