The document presents a compact routing scheme that routes on power law graphs with additive stretch. It breaks the graph into a dense core and fringe. It uses known ultra-compact routing algorithms like Thorup-Zwick to route within trees covering the core and fringe. Node names are topology dependent and routing tables use O(e log2 n) bits. The scheme finds the highest degree node, grows a shortest path tree to define the core, and additional trees to cover the remaining fringe edges.