Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications

Édouard Bonnet, Colin Geniet, Eun Jung Kim +1

A signed tree model of a graph $G$ is a compact binary structure consisting of a rooted binary tree whose leaves are bijectively mapped to the vertices of $G$, together with 2-colo…