The additional constraints ensure that only one virtual edge can be active (12), that the virtual node can only send flow over this active edge (11) and that the total amount of flow sent from the root cannot exceed the size of the selected subgraph (13).
if n concepts are selected, n units of flow are sent from the root over the edges of the graph and each selected concept consumes one of them.