Figure 8 Performance of computing minimum cycle basis.
In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor.
The set cover problem is that of computing a minimum weight subfamily F′, given a family F of weighted subsets of a base set U, such that every element of U is covered by some subset in F′.
In this paper, we study the geodetic convexity of graphs, focusing on the problem of the complexity of computing a minimum hull set of a graph in several graph classes.
A comparison of computing the Minimum Cycle Basis (MCB) using the old implementation (SSSRFinder) compared to the new implementation.
The NP-hard problem of computing a minimum CDS of G is well studied, see [28, 30, 31], and references therein, and there are many approximation algorithms.
The problem of computing the minimum sequence of operations that transforms one genome into another – which is equivalent to the problem of sorting a permutation into the identity permutation – is a well-studied problem that finds application in comparative genomics.
Therefore, for a subset Y ⊆ X of k haplotypes, we now consider the problem of computing the minimum and maximum possible haplotype connectivity, denoted by HCmin(k) and HCmax k), respectively, over all subsets of X containing precisely k haplotypes.
Our algorithm is based on transforming the change detection problem to a problem of computing a minimum-cost edge cover of a bipartite graph.
The problem of computing a minimum-latency gossiping schedule for a given WMN is NP-hard, hence it is only possible to get a polynomial approximation algorithm.
