Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs

Jinfeng Dou, Thorsten Götte, Henning Hillebrandt +2

We consider the problem of computing compact routing tables for a (weighted) planar graph $G:=(V,E,w)$ in the PRAM, CONGEST, and the novel HYBRID communication model. We present…