This paper studies labeling schemes for flow and connectivity functions. A flow labeling scheme using $O(\log n\cdot\log {\hat{\omega}}+\log^2 n)$-bit labels is presented for general n-vertex graphs with maximum (integral) capacity ${\hat{\omega}}$. ...
We focus on range query processing on large-scale, typically distributed infrastructures, such as clouds of thousands of nodes of shared-datacenters, of p2p distributed overlays, etc. In such distributed environments, efficient range query processing is ...
A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. We propose a series of new labeling schemes within ...
Springer-Verlag
Berlin, Heidelberg
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in