Succinct Greedy Geometric Routing Using Hyperbolic Geometry

[摘要]：We describe a method for performing greedy geometric routing for any n-vertex simple connected graph G in the hyperbolic plane, so that a message M between any pair of vertices may be routed by having each vertex that receives M pass it to a neighbor that

[全文传递流程]：

一般上传文献全文的时限在1个工作日内