prov:value
| - The original tree (see FIG. 2) is now partitioned into two trees, the original one (Tree (A)) excluding nodes C, G, D, E and F, and a new tree including only those nodes C, G, D, E and F. By definition, the child node at the failing edge, that is node C, is assumed to be the root for the tree including nodes C, D, E, F, and G. This second tree may be labelled Tree (C).
|