An algorithm for finding a maximal cutset of the WLFG is given such that (1) a maximal cutset does not contain two arcs that lie on a single path of the WLFG, and (2) its capacity is equal to the cardinality of a minimal set of base paths of the program. The algorithm ...
An Algorithm for Finding Frequent Itemset based on Lattice Approach for Lower Cardinality Dataset In recent years, mining for association rules between items sets in a large database has been described as an important database-mining problem. The problem of discovering association rules has received...
The restriction on generator set cardinality is the best possible, as the problem becomes soluble in polynomial time if the generator set contains only one permutation. Some restricted versions of the problem, in which the generator set is fixed rather than being part of the problem instance, ...
apeptid -dna(from fish)origin-france peptid -脱氧核糖核酸(从鱼)起源法国 [translate] a4456 BT Lewedorp 4456 BT Lewedorp [translate] a其出土的太阳神鸟金箔是中国文化遗产标志 Its unearthed solar phoenix gold foil is the China cultural heritage symbol [translate] aMaximal cardinality of linearly ...
Assume now that for every i there is only one color class Bi of size at least k+1 in Ai∪Q (there has to be at least one because the cardinality of Ai∪Q is at least cq+q>ck). We are going to compare the color of Bi and Bj for Bi∩Bj=0̸. In order to do that, we ...
The algorithms receives as arguments the graph, the heuristic used to evaluate the independent set candidates, and the initial cardinality of the independent sets, and returns the final set of independent sets.doi:10.48550/arXiv.1505.00752Asbj?rn Br?ndeland...
The paper surveys the techniques used for designing the most efficient algorithms for finding a maximal (cardinality or weighted) matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements and the existence of fast parallel algorithms for these problems...
Similarly, a ball b is a non-minority ball of a set A if there are at least |A|2 balls in the set that have the same color as b. Note that these two notions are different if and only if n is even and |A|2 balls are colored of the same color, in which case each of these...
holds. A DS with the minimum cardinality is called a minimum dominating set (MDS). MDSM is defined by extending this definition of MDS. Let \({\mathscr{G}}=\{{G}_{i}({V}_{i},{E}_{i})|i=1,\ldots ,N\}\) be a set (multiset) of undirected networks. That is, \({\mathsc...
When queries with identical query hashes are executed against different data, the differences in the cardinality of query results can cause the query optimizer to choose different query execution plans, resulting in different query plan hashes. The following example shows how two similar queries can...