Throughout this section, let (X, Y, w) be a matching instance.
The All- Cavity- MCM problem [ 28] is, given a matching instance (X, Y, w), to compute MCM X, Y ∖ { y}, w) for all y ∈ Y.
We define the All- Pairs- Cavity- MCM problem as, given a matching instance (X, Y, w), to compute MCM(X ∖ { x}, Y ∖ { y}, w) for all x ∈ X and y ∈ Y.
The Min-Cost Bipartite Matching problem (MCM) is, given a matching instance (X, Y, w), to find the minimum cost of a matching between X and Y with respect to w. Denote by MCM X, Y, w) the solution of the MCM problem for the instance (X, Y, w), and call a matching whose cost equals to the solution optimal.
If there is no matching instance for (pi ) or no reduction of (S,P) is possible, then (pi ) reduces to itself.
All four dimensions are partially expanded into independent hierarchies where each concept has at least one matching instance in NeuroMorpho.Org.
The process of simplification of a constraint set, also called context reduction, consists of reducing each constraint (pi ) in this set to the context obtained by recursively reducing the context (P) of the matching instance for (pi ) in (Theta ), if such matching exists, until (P=emptyset ) or there exists no instance in (Theta ) that matches with (pi ).
A matching instance is a triplet (X, Y, w), where X and Y are two sets, and w is a matching cost function for X and Y.
Equation 5 is computed once for each v ∈ T and v′ ∈ S in line 3, where the corresponding matching instance's group sizes are d v and d v ′.
Note that for the entries in this row, the first group in the bipartite matching instance is fixed and equals to N u) ∖ { v 1 }, whereas for each column j, the second group in the matching instance is N (u ′ ) ∖ { v j ′ }.
Observe that the right-hand side of Equation 4 equals the cost of the bipartite matching M v, v ′ A for the matching instance (N (v ), N (v ′ ), w v, v ′ ) (see Figure 3b).
