منابع مشابه
Pattern Matching for Permutations
Given a permutation T of 1 to n, and a permutation P of 1 to k, for k ≤ n, we wish to find a k-element subsequence of T whose elements are ordered according to the permutation P . For example, if P is (1, 2, . . . , k), then we wish to find an increasing subsequence of length k in T ; this special case can be done in time O(n log log n) [CW]. We prove that the general problem is NP-complete. We...
متن کاملDistributed Approximation of Maximum Independent Set and Maximum Matching
We present a simple distributed ∆-approximation algorithm for maximum weight independent set (MaxIS) in the CONGEST model which completes in O(MIS(G) · logW ) rounds, where ∆ is the maximum degree, MIS(G) is the number of rounds needed to compute a maximal independent set (MIS) on G, and W is the maximum weight of a node. Plugging in the best known algorithm for MIS gives a randomized solution ...
متن کاملMax Product for Max-Weight Independent Set and Matching
The Max Product (MP) is a local, iterative, message passing style algorithm that has been developed for finding the maximum a posteriori (MAP) assignment of discrete probability distribution specified by a graphical model. The scope of application of MP is vast and in particular it can serve as a heuristic to solve any combinatorial optimization problem. Despite the success of MP algorithm in t...
متن کاملParallel Algorithms for Maximal Independent Set and Maximal Matching
We present a derandomization process which leads to efficient parallel algorithms for the maximal independent set and maximal matching problems. The derandomization of the general pairs PROFIT/COST problem depends on the derandomization of the bit pairs PROFIT/COST problem which follows Luby’s approach of using an O(n) sized sample space. This simplifies the approach presented in [16].
متن کاملMin-Wise Independent Permutations
We define and study the notion of min-wise independent families of permutations. We say that F ⊆ Sn is min-wise independent if for any set X ⊆ [n] and any x ∈ X, when π is chosen at random in F we have Pr(min{π(X)} = π(x)) = 1 |X| . In other words we require that all the elements of any fixed set X have an equal chance to become the minimum element of the image of X under π. Our research was mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22724