Results 61 to 70 of about 13,294,177 (308)
Distributed Approximation of Maximum Independent Set and Maximum Matching [PDF]
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 2017 We present a simple distributed Δ-approximation algorithm for maximum weight independent set (MaxIS) in the CONGEST model which completes in O(MIS ⋅ log W) rounds, where Δ is the maximum degree, MIS is the number of rounds needed to compute a maximal ...
R. Bar-Yehuda +3 more
semanticscholar +1 more source
Engineering Science and Technology, an International JournalIn this study, a method has been developed for solving the maximum independent set problem, which is one of the significant problems in graph theory. The maximum independent set problem is NP-hard for all types of graphs.
Furkan Öztemiz
doaj +1 more source
A New Algorithm for the Robust Semi-random Independent Set Problem [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 In this paper, we study a general semi-random version of the planted independent set problem in a model initially proposed by Feige and Kilian, which has a large proportion of adversarial edges. We give a new deterministic algorithm that finds a list of
T. McKenzie, Hermish Mehta, L. Trevisan
semanticscholar +1 more source
Inapproximability of the independent set polynomial in the complex plane [PDF]
Symposium on the Theory of Computing, 2017 We study the complexity of approximating the value of the independent set polynomial ZG(λ) of a graph G with maximum degree Δ when the activity λ is a complex number.
Ivona Bezáková +3 more
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Children with sickle cell disease (SCD) face multiple acute and chronic medical complications that may impact their quality of life as reported by patients themselves. Health‐related social needs (HRSNs), such as food and housing insecurity, are common in people with SCD, but the association between HRSNs and patient‐reported ...
Sarah J. Marks +5 more
wiley +1 more source
On some invariants of finite groups [PDF]
International Journal of Group Theory, 2013 In this note we are going to survey several invariants of finite groups related either to theirorders or to generating sets or to lattices of subgroups. Some relations among these invariants will be exhibited.
Jan Krempa, Agnieszka Stocka
doaj
Approximation Schemes for Independent Set and Sparse Subsets of Polygons [PDF]
Journal of the ACM, 2017 We present a (1+ε)-approximation algorithm with quasi-polynomial running time for computing a maximum weight independent set of polygons from a given set of polygons in the plane. Contrasting this, the best-known polynomial time algorithm for the problem
Anna Adamaszek +2 more
semanticscholar +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Cup‐like nuclei are a distinctive morphological feature observed in certain cases of acute lymphoblastic leukemia (ALL). We provide evidence that they characterize DUX4/ERG ALL independently of IKZF1 deletion and reveal marked mitochondrial accumulation in this ALL subset.
Chloé Arfeuille +9 more
wiley +1 more source
Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs
Discussiones Mathematicae Graph Theory, 2015 The direct product of graphs G = (V (G),E(G)) and H = (V (H),E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We
Paj Tjaša, Špacapan Simon
doaj +1 more source
Layered Graphs: Applications and Algorithms
Algorithms, 2018 The computation of distances between strings has applications in molecular biology, music theory and pattern recognition. One such measure, called short reversal distance, has applications in evolutionary distance computation. It has been shown that this
Bhadrachalam Chitturi +3 more
doaj +1 more source