Hitting All Maximal Independent Sets of a Bipartite Graphdoi:10.1007/S00453-013-9847-3Jean CardinalGwenal JoretSpringer US
Moreover, we prove that any rich set extended with all strings within Hamming distance of 3 is a hitting set for read-once branching programs of width 3. Then, we show that any almost $O(\\log n)$-wise independent set ... J Íma,S Ák 被引量: 0发表: 2021年 A polynomial time...
1.In this paper,an improved genetic algorithm (called MGA) is used to computeminimal hitting sets.采用改进的遗传算法求解极小碰集问题。 2.Furthermore, the computing procedure is formalized by combining SE-tree with closed nodes to generate all theminimal hitting sets.提出一种利用与元素相关联的冲...
There exists an algorithm that on n-vertex, m-edge hypergraphs enumerates the minimal hitting sets with delay ⁎O(mk⁎+1n2) in O(mn) space, where ⁎k⁎ is the maximum cardinality of any minimal hitting set. At its core, the algorithm is a tree search in the space of all vert...
The NP-complete Maximum Independent Set problem was studied in a series of papers [10], [29], [36], [40], the best known general bound so far being O(1.211n), where n is the number of vertices in the given graph. Also, special cases (e.g., bounded vertex degree) have recently...
The sun’s magnetic field and solar wind combine to create a porous ‘shield’ that fends off cosmic rays attempting to enter the solar system. The shielding action of the sun is strongest during Solar Maximum and weakest during Solar Minimum–hence the 11-year rhythm of the mission duration...
Zhang, N., Shin, I., Zou, F., Wu, W., Thai, M.T.: Trade-off scheme for fault tolerant connected dominating sets on size and diameter. FOWANC, pp. 1–8 (2008) Google Scholar Zhao, Y., Wu, J., Li, F., Lu, S.: VBS: Maximum lifetime sleep scheduling for wireless sensor...
A bicolored rectangular family BRF is the collection of all axis-parallel rectangles formed by selecting a bottom-left corner from a finite set of points A and an upper-right corner from a finite set of points B. We devise a combinatorial algorithm to compute the maximum independent set and ...
Finding a maximum independent set of a given family of axis-parallel rectangles is a basic problem in computational geometry and combinatorics. This problem has attracted significant attention since the sixties, when Wegner conjectured that the corresponding duality gap, i.e., the maximum possible ...
Sima, J., Zak, S.: Almost k-wise independent sets establish hitting sets for width 3 1-branching programs. In: 6th international computer science symposium in Russia, pp 120–133 (2011)Sˇ´ima, J., Zˇ´ak, S.: Almost k-wise independent sets establish hitting sets for width-3 ...