Figure 3
From: Maximizing output and recognizing autocatalysis in chemical reaction networks is NP-complete
Implementation of merge- and expansion edges. Consider the binary representation bm-1bm-2... b0 of k > 0 with m = ⌊log k⌋ + 1. Let B = {i1, i2, ..., i r } be the indices of all non-zero bits, i.e., i ∈ B with b i = 1. (A) Implementation of a (k → 1) merge-edge. (B) Implementation of a (1 → k) expansion-edge. The red edges indicate (2i → 1) merges and (1 → 2i) expansions, respectively.