Results 41 to 50 of about 8,249,666 (288)
Exact Algorithms for Maximum Independent Set [PDF]
, 2013 We show that the maximum independent set problem (MIS) on an $n$-vertex graph can be solved in $1.1996^nn^{O(1)}$ time and polynomial space, which even is faster than Robson's $1.2109^{n}n^{O(1)}$-time exponential-space algorithm published in 1986.
D. Eppstein +12 more
core +2 more sources
Recoverable Values for Independent Sets [PDF]
Random Structures & Algorithms, 2011 AbstractThe notion of recoverable value was advocated in the work of Feige, Immorlica, Mirrokni and Nazerzadeh (APPROX 2009) as a measure of quality for approximation algorithms. There, this concept was applied to facility location problems. In the current work we apply a similar framework to the maximum independent set problem (MIS).
Feige, Uriel, Reichman, Daniel
openaire +2 more sources
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
Fair Packing of Independent Sets [PDF]
, 2020 In this work we add a graph theoretical perspective to a classical problem of fairly allocating indivisible items to several agents. Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph.
Chiarelli, Nina +5 more
openaire +2 more sources
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
Distributed Approximation of Maximum Independent Set and Maximum Matching
, 2017 We present a simple distributed $\Delta$-approximation algorithm for maximum weight independent set (MaxIS) in the $\mathsf{CONGEST}$ model which completes in $O(\texttt{MIS}(G)\cdot \log W)$ rounds, where $\Delta$ is the maximum degree, $\texttt{MIS}(G)$
Bar-Yehuda Reuven +5 more
core +1 more source
Two Remarks on Independent Sets [PDF]
Journal of Algebraic Combinatorics, 1993 Let \(S = k[x_ v,\;v \in V]\) be a polynomial ring over a field \(k\), equipped with a noetherian term order \(
openaire +2 more sources
Statistical mechanics of maximal independent sets [PDF]
Physical Review E, 2009 The graph theoretic concept of maximal independent set arises in several practical problems in computer science as well as in game theory. A maximal independent set is defined by the set of occupied nodes that satisfy some packing and covering constraints.
Dall'Asta, Luca +2 more
openaire +5 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Oral mucositis is a common and debilitating side effect of childhood cancer and stem cell transplant treatments. It affects the quality of life of children and young people (CYP) and places a strain on services. Photobiomodulation is recommended for oral mucositis prevention in international guidance but is poorly implemented in UK ...
Claudia Heggie +4 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