Although Lokshtanov et al. [1]} used this algorithm as a black box,
we are required to open up this black box to
analyze the dependence on \(n\)  in the running time of [1]}.
The goal here is to compute a flow function \(\psi \)  homologous to a given flow function \(\phi \)  such that
\(\psi \)  represents a \(T\) -linkage of \(G\) .
To control the number of edges with \(\psi (\cdot )\ne \epsilon \)  incident to a common vertex,
Schrijver [3]} introduced a more general problem setting: the homology feasibility problem.
