Results 51 to 60 of about 996,556 (196)
An unconstrained binary quadratic programming for the maximum independent set problem
Nonlinear Analysis, 2012 For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary ...
Sidi Mohamed Douiri, Souad Elbernoussi
doaj
A characterization of trees with equal 2-domination and 2-independence numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.
Christoph Brause +2 more
doaj +1 more source
Analisis dan Implementasi Algoritma Finding Maximum Independent Set (FMIS) Untuk Mencari Maximum Independent Set Pada Graf [PDF]
, 2013 ABSTRAKSI: Pencarian Maximum Independent Set (MIS) pada sebuah graf adalah salah satu permasalahan NP-Complete. Maximum Independent Set (MIS) pada sebuah graf memiliki penerapan yang penting dan diperlukan algoritma yang tepat untuk mencarinya ...
Arifin Suhendar
core
Complexity of approximating bounded variants of optimization problems
, 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
Improved Distributed Approximations for Maximum Independent Set [PDF]
, 2020 We present improved results for approximating maximum-weight independent set (MaxIS) in the CONGEST and LOCAL models of distributed computing. Given an input graph, let n and Δ be the number of nodes and maximum degree, respectively, and let MIS(n,Δ) be ...
Kawarabayashi, Ken-ichi +3 more
core +1 more source
Computational Aspects of Carbon and Boron Nanotubes
Molecules, 2010 Carbon hexagonal nanotubes, boron triangular nanotubes and boron a-nanotubes are a few popular nano structures. Computational researchers look at these structures as graphs where each atom is a node and an atomic bond is an edge.
Paul Manuel
doaj +1 more source
Quantum Optimization with Arbitrary Connectivity Using Rydberg Atom Arrays
PRX Quantum, 2023 Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits.
Minh-Thi Nguyen +5 more
doaj +1 more source
Improved Distributed Approximations for Maximum Independent Set
CoRR, 2019 We present improved results for approximating maximum-weight independent set ($\MaxIS$) in the CONGEST and LOCAL models of distributed computing. Given an input graph, let $n$ and $Δ$ be the number of nodes and maximum degree, respectively, and let $\MIS(n,Δ)$ be the the running time of finding a \emph{maximal} independent set ($\MIS$) in the CONGEST ...
Kawarabayashi, Ken-ichi +3 more
openaire +4 more sources
Maximum independent sets in subcubic graphs: New results [PDF]
Theoretical Computer Science, 2019 The maximum independent set problem is known to be NP-hard in the class of subcubic graphs, i.e. graphs of vertex degree at most 3. We present a polynomial-time solution in a subclass of subcubic graphs generalizing several previously known results.
Ararat Harutyunyan +3 more
openaire +4 more sources
The Power of the Lorentz Quantum Computer
EntropyWe analyze the power of the recently proposed Lorentz quantum computer (LQC), a theoretical model leveraging hyperbolic bits (hybits) governed by complex Lorentz transformations.
Qi Zhang, Biao Wu
doaj +1 more source