Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Succinct Greedy Graph Drawing in the Hyperbolic Plane   We describe an efficient method for drawing any n-vertex simple graph G in
the hyperbolic plane. Our algorithm produces greedy drawings, which support
greedy geometric routing, so that a message M between any pair of vertices may
be routed geometrically, simply by having each vertex that receives M pass it
along to any neighbor that is closer in the hyperbolic metric to the message's
eventual destination. More importantly, for networking applications, our
algorithm produces succinct drawings, in that each of the vertex positions in
one of our embeddings can be represented using O(log n) bits and the
calculation of which neighbor to send a message to may be performed efficiently
using these representations. These properties are useful, for example, for
routing in sensor networks, where storage and bandwidth are limited.

5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
23
The categories of this paper are: solv-int
20
The categories of this paper are: acc-phys
36
The categories of this paper are: cmp-lg
31
The categories of this paper are: ao-sci
30
The categories of this paper are: q-alg
33
The categories of this paper are: plasm-ph
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
9
The categories of this paper are: nlin
13
The categories of this paper are: quant-ph