Results 1 to 10 of about 13,294,177 (308)
Using synchronized oscillators to compute the maximum independent set. [PDF]
Nat Commun, 2020 Not all computing problems are created equal. The inherent complexity of processing certain classes of problems using digital computers has inspired the exploration of alternate computing paradigms.
Mallick A +5 more
europepmc +2 more sources
On the Independent Set Sequence of a Tree [PDF]
The Electronic Journal of Combinatorics, 2020 Alavi, Malde, Schwenk and Erdős asked whether the independent set sequence of every tree is unimodal. Here we make some observations about this question.
A. Basit, David J. Galvin
semanticscholar +5 more sources
On the independent set interdiction problem [PDF]
Electronic Journal of Graph Theory and Applications, 2015 The purpose of the independent set interdiction problem in the weighted graph $G$ is to determine a set of vertices $R^*$ such that the weight of the maximum independent set in $G-R^*$ is minimized.
Gholam Hassan Shirdel, Nasrin Kahkeshani
doaj +2 more sources
Independent point-set dominating sets in graphs [PDF]
AKCE International Journal of Graphs and Combinatorics, 2020 In this paper, we study graphs which possess an independent point-set dominating set (in short, ipsd-set). We call such a graph as an ipsd-graph. We first provide general structural characterization of separable ipsd-graphs and thereafter, in our quest ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj +2 more sources
Quantum optimization of maximum independent set using Rydberg atom arrays [PDF]
Science, 2022 Realizing quantum speedup for practically relevant, computationally hard problems is a central challenge in quantum information science. Using Rydberg atom arrays with up to 289 qubits in two spatial dimensions, we experimentally investigate quantum ...
S. Ebadi +23 more
semanticscholar +1 more source
Local Computation of Maximal Independent Set [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2022 We present a randomized Local Computation Algorithm (LCA) with query complexity poly $(\Delta) \cdot \log n$ for the Maximal Independent Set (MIS) problem.
M. Ghaffari
semanticscholar +1 more source
Approximating Maximum Independent Set for Rectangles in the Plane [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2021 We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.
Joseph S. B. Mitchell
semanticscholar +1 more source
Sum-of-Squares Lower Bounds for Sparse Independent Set [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2021 The Sum-of-Squares (SoS) hierarchy of semidefinite programs is a powerful algorithmic paradigm which captures state-of-the-art algorithmic guarantees for a wide array of problems.
Chris Jones +4 more
semanticscholar +1 more source
On the convexity of independent set games [PDF]
Discrete Applied Mathematics, 2021 Independent set games are cooperative games defined on graphs, where players are edges and the value of a coalition is the maximum cardinality of independent sets in the subgraph defined by the coalition. In this paper, we investigate the convexity of independent set games, as convex games possess many nice properties both economically and ...
Qizhi Fang, Yuanxi Wang, Han Xiao 0003
openaire +3 more sources
Independent partial domination
Cubo, 2021 For $p\in(0,1]$, a set $S\subseteq V$ is said to $p$-dominate or partially dominate a graph $G = (V, E)$ if $\frac{|N[S]|}{|V|}\geq p$. The minimum cardinality among all $p$-dominating sets is called the $p$-domination number and it is denoted by ...
L. Philo Nithya +1 more
doaj +1 more source