Edge Labeling Schemes for Graph Data
Oshini Goonetilleke, Danai Koutra, Timos Sellis, Kewen Liao · 2017
Given a directed graph, how should we label both its outgoing and incoming edges to achieve better disk locality and support neighborhood-related edge queries? In this paper, we answer this question with edge-labeling schemes GrdRandom and FlipInOut, to label edges with integers based on the premise that edges should be assigned integer identifiers exploiting their consecutiveness to a maximum degree.