An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O(20.276n) improving on a previous bound of O(2n3). The improvement comes principally from three sources: first, a modified recursive algorithm based on a more detailed study of ...
学术范收录的Repository Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws,目前已有全文资源,进入学术范阅读全文,查看参考文献与引证文献,参与文献内容讨论。学术范是一个在线学术交流社区,收录论文、作者
Measure and conquer : A simple O(2^) independent set algorithm We show that the maximum independent set problem (MIS) on an n-vertex graph can be solved in 1.2002~nnO(1) time and polynomial space, which is even faster ... FV Fomin - Seventeenth Acm-siam Symposium on Discrete Algorithms...
where n is the number of vertices and m is the number of hyperedges.Using the exact algorithm for the maximum independent set problem in undirected graphs, an mathcalO^*1.1996^n-time for MISH can be directly obtained.In this paper, we show that PC-MISH can be solved in mathcalO^*1.95...
Stability numbers of a graph have been well studied, but little has been done on the number of independent subsets whose cardinality is the stability number. In this paper we will provide an algorithm to find the number of independent subsets whose cardinality is the stability number....
( G ), we give a linear-time algorithm to find a minimum clique-transversal set and a maximum clique-independent set simultaneously for distance-... CM Lee,MS Chang - 《Discrete Applied Mathematics》 被引量: 74发表: 2006年 Improvement in quantitative non-linear feedback design by cancellation...
(B–K) algorithm which guarantees an optimal MIS solution, when it converges. It can be observed that the solution to most of the analyzed graph instances lies near—or on the identity line (i.e.y = x) implying that the oscillator system computes an MIS that is close to the ...
question for rectangles affirmatively with only axis-parallel cuts, this would yield a combinatorial O(1)-approximation algorithm for the Maximum Independent Set of Rectangles problem, and would thus solve a long-standing open problem. In... F Abed,P Chalermsook,J Correa,... - 《Lipics Leibniz...
Sampling frequency thresholds for the quantum advantage of the quantum approximate optimization algorithm Article Open access 25 July 2023 Data availability The data that support the findings of this study are available from Figshare, the public data repository at https://doi.org/10.6084/m9.figsha...
The asymptotic value of I ( n,c )/ n as n →∞, can be computed using the Karp-Sipser algorithm when c ≤ e . For random cubic graphs, r = 3, it is only known that .432 ≤ lim inf n I ( n ,3)/ n ≤ lim sup n I ( n ,3)/ n ≤ .4591 with high probability (w....