Results 31 to 40 of about 996,556 (196)
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
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
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
THE NUMBER OF MAXIMUM INDEPENDENT SETS IN GRAPHS
Taiwanese Journal of Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jou, M.J., Chang, G.J.
openaire +3 more sources
Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling
ISPRS International Journal of Geo-Information, 2017 Map labeling is a classical problem of cartography that has frequently been approached by combinatorial optimization. Given a set of features in a map and for each feature a set of label candidates, a common problem is to select an independent set of ...
Jan-Henrik Haunert, Alexander Wolff
doaj +1 more source
Towards maximum independent sets on massive graphs [PDF]
Proceedings of the VLDB Endowment, 2015 Maximum independent set (MIS) is a fundamental problem in graph theory and it has important applications in many areas such as social network analysis, graphical information systems and coding theory. The problem is NP-hard, and there has been numerous studies on its approximate solutions.
Yu Liu 0070 +4 more
openaire +2 more sources
IEEE Access, 2020 Radio Frequency IDentification (RFID) systems often encounter reader collisions when multiple readers interrogate tags at the same time. Especially in the mobile RFID system, the mobility of readers leads to more reader collisions.
Zhonghua Li +3 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 +2 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