Entering edge

En´ter`ing edge


1.same as Advancing edge.
References in periodicals archive ?
The selected node is split intoseveral identical copies, one for each entering edge. This approach has the advantage that it is rather simple, but it has the disadvantage that it can select nodes that did not have to be split to make a graph reducible.
The number of copies is not equal to the number of splits because a split creates a copy for every entering edge. If a node has n entering edges then one split creates n - I copies.