Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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:

enter image description here

enter image description here

share|cite|improve this question
I don't understand what you mean by a "binary embedding of a tree." There are many papers about embedding binary trees into graphs. For example, embedding binary trees into d-dimensional hypercubes. – Joseph Malkevitch Sep 29 '13 at 21:51
@JosephMalkevitch Added definition of binary embedding. – John Hass Sep 30 '13 at 4:26

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.