- restricted class of graphs: quasi-hierarchical
- inappropriate spanning tree misleading
- all data must fit into main memory
- 100,000 edges need 1GB main memory
- nonincremental mapping from hyperbolic to euclidean space
- nonincremental layout
- no abstraction or landmarks