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...
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
Effective placement of resources used to support distributed services in the Internet depends on an accurate representation of Internet topology and routing. Representations of au...
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...