I'm working on my final year project which will establish an reasonable upper bound for one of the bandwidth problem in graph theory. I found difficulty on understanding an algorithm that construct an binary embedding for a tree. The paper lacks essential guide to terminology and I'm beginner at graph theory.
Can you recommend a friendly intro to such algorithm?
Definition of binary embedding: