 In contrast, proving that the problem is fixed-parameter tractable is an exercise in designing kernelization algorithms, which appears as such in the textbook by .also provide a concrete bound on the size of the resulting kernel, which has meanwhile been improved by .In fact, for a given bipartite graph on "n" vertices, it can be decided in time formula_33 with formula_34 whether its bipartite dimension is at most "k" 

The problem of determining the bipartite dimension of a graph appears in various contexts of computing.