Abstract
We present a technique for representing bounded-degree planar graphs in a succinct fashion while permitting I/O-efficient traversal of paths. Using ou......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
