Fig. 4From: Bi-pattern mining of attributed networksThe search tree developed by minerLC during the bi-pattern enumeration of Example 4. Each box represents on the first line a bi-pattern q together with its support set pair e in the current vertex set, and on the second line the core p(e) of the subgraph induced by this support set pair, preceded by the associated abstract closed bi-pattern int∘p(e). In the top box q is the empty bi-pattern, and its successors are obtained by adding an item to the abstract bi-pattern of the top box. In all leaves the core p(e) is emptyBack to article page