Fig. 9

Decomposition of the edge-based network N^u into its maximal biconnected components that are either trivial SP graphs, i.e., single edges (corresponding to cut edges of N^u), or simple and biconnected SP graphs with at least three vertices. For the latter, valid spanning trees are depicted in bold, respectively. The edges of these spanning trees together with all cut edges (also depicted in bold) yield a support tree for N^u and thus N^u is tree-based