Before revision:  In addition, for graphs we provide a "spanning" version of this theorem , and use it to devise the first compact routing scheme with constant size routing tables.
After revision:  In addition, for graphs we provide a "spanning" version of this theorem for graphs and use it to devise the first compact routing scheme with constant size routing tables.