  Graph decompositions are the natural generalisation of tree decompositions
where the decomposition tree is replaced by a genuine graph. Recently they
found theoretical applications in the theory of sparsity, topological graph
theory, structural graph theory and geometric group theory.
  We demonstrate applicability of graph decompositions on large networks by
implementing an efficient algorithm and testing it on road networks.
