Fig. 3From: The Minimal k-Core Problem for Modeling k-AssembliesBacktrack search tree for a given graph G. The root of the tree contains the entire graph and the leaves contain minimal k-cores or extensions that made the algorithm backtrack. The sets kcore, not, and candidates follow the definitions of Algorithm 4 Back to article page