In particular, there exists some n-node graph G with f(L,f)(G) > n/2 - O(logn). login-. 2. rA^. Proof. Let (L, f) be any (s-stretched) distance labeling scheme on F .