Succinct Representation of Labeled Graphs

Abstract. We consider the problem of designing succinct representations of labeled graphs (we consider vertex labeled planar triangulations, as well as edge labeled planar graphs and the more general k-page graphs) The goal is to support various label queries eciently, while using an amount of additional space to store the labels which is essentially the information-theoretic minimum. As far as we know, our representations are the rst succinct representations of labeled graphs. First, we dene three new traversal orders on the vertices of a planar triangulation, allowing to design a succinct representation which supports eciently labeled based navigation operators. Second, we design a succinct representation for a k-page graph when k is large supporting vertex adjacency in O(lg k lg lg k) time (while previous work uses O(k) time [9, 11]).

• Type: Conference
• Year: 2007
• Where: ISAAC
• Authors: Jérémy Barbay, Luca Castelli Aleardi, Meng He, J. Ian Munro
• Keywords: Edge Labeled Planar, ISAAC 2007, Succinct Representation, Vertex Labeled Planar