Labeling Schemes for Bounded Degree Graphs


We investigate adjacency labeling schemes for graphs of bounded degree ∆ = O(1). In particular, we present an optimal (up to an additive constant) log n+ O(1) adjacency labeling scheme for bounded degree trees. The latter scheme is derived from a labeling scheme for bounded degree outerplanar graphs. Our results complement a similar bound recently obtained… (More)
DOI: 10.1007/978-3-662-43951-7_32

5 Figures and Tables


  • Presentations referencing similar topics