Results 31 to 40 of about 10,268,798 (293)
Tạp chí Khoa học Đại học Đà Lạt, 2021 Let \(G\) be an undirected simple graph on n vertices and \(\sigma^2(G)=n-2\) (degree sum of any two non-adjacent vertices in \(G\) is equal to \(n-2\)) and \(\alpha(G)\) be the cardinality of an maximum independent set of \(G\).
Do Nhu An
doaj +1 more source
The complexity of combinatorial optimization problems on d‐dimensional boxes [PDF]
, 2007 The Maximum Independent Set problem in d-box graphs, i.e., in intersection graphs of axis-parallel rectangles in R-d, is known to be NP-hard for any fixed d >= 2.
Chlebikova, Janka +5 more
core +1 more source
Distributed Approximation of Maximum Independent Set and Maximum Matching [PDF]
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017 We present a simple distributed $Δ$-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 $Δ$ is the maximum degree, $\texttt{MIS}(G)$ is the number of rounds needed to compute a maximal independent set (MIS) on $G$, and $W$ is the maximum ...
Bar-Yehuda, Reuven +3 more
openaire +3 more sources
On the number of maximum independent sets of graphs [PDF]
Transactions on Combinatorics, 2014 Let $G$ be a simple graph. An independent set is a set of pairwise non-adjacent vertices. The number of vertices in a maximum independent set of $G$ is denoted by $alpha(G)$. In this paper, we characterize graphs $G$ with $n$ vertices and with maximum
Tajedin Derikvand, Mohammad Reza Oboudi
doaj
Complexity of approximating bounded variants of optimization problems [PDF]
, 2006 We study low degree graph problems such as Maximum Independent Set and Minimum Vertex Cover. The goal is to improve approximation lower bounds for them and for a number of related problems like Max-B-Set Packing, Min-B-Set Cover, and Max-B-Dimensional ...
Chlebikova, Janka +3 more
core +1 more source
On the Maximum Independent Set Problem in Subclasses of Planar Graphs
Journal of Graph Algorithms and Applications, 2010 The maximum independent set problem is known to be NP-hard in the class of planar graphs. In the present paper, we study its complexity in hereditary subclasses of planar graphs.
Vadim Lozin, Martin Milanič
doaj +1 more source
Physical Review Research, 2023 Rydberg atom arrays are among the leading contenders for the demonstration of quantum speedups. Motivated by recent experiments with up to 289 qubits [Ebadi et al., Science 376, 1209 (2022)0036-807510.1126/science.abo6587], we study the maximum ...
Ruben S. Andrist +11 more
doaj +1 more source
Maximum weight independent set in trees [PDF]
BIT, 1987 Computing a maximum independent set, weighted or unweighted, is NP-hard for general as well as planar graphs. However, polynomial time algorithms do exist for solving this problem on special classes of graphs. In this paper we present an efficient algorithm for computing a maximum wehe extent to which, given two categories A and B and a functor K from ...
openaire +3 more sources
Message Passing for Maximum Weight Independent Set [PDF]
IEEE Transactions on Information Theory, 2009 We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of the classical loopy max-product belief propagation. We show that each fixed point estimate of max-product can be mapped in a natural way to an extreme point of the LP polytope associated ...
Sanghavi, Sujay +2 more
openaire +4 more sources
Finding a Maximum Independent Set in a Sparse Random Graph [PDF]
, 2005 We consider the problem of finding a maximum independent set in a random graph. The random graph G is modelled as follows. Every edge is included independently with probability d n, where d is some sufficiently large constant.
Eran Ofek, Uriel Feige
core +1 more source