Results 121 to 130 of about 10,268,798 (293)
On maximum independent sets in \(P_{5}\)-free graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bert Randerath, Ingo Schiermeyer
openaire +2 more sources
Artificial molecular machines and motors—Design and control of nanoscale motion
FEBS Letters, EarlyView.Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source
Quantum Hamiltonian algorithms for maximum independent sets
National Science ReviewABSTRACT We compare two quantum Hamiltonian algorithms that address the maximum independent set problem: one based on the emergent non-Abelian gauge matrix in adiabatic evolution of an energetically isolated manifold of states; the other based on designed application of single-qubit operations. We demonstrate that they are mathematically
Xianjue Zhao +5 more
openaire +4 more sources
Leucine‐rich glioma inactivated 1 (LGI1) is a ganglioside‐binding protein
FEBS Letters, EarlyView.Neuronal hyperexcitability associated with a decrease/absence of the extracellular protein LGI1 has been suggested to be primarily due to the downregulation of Kv1 channel expression. The molecular mechanisms underlying this decrease have not yet been elucidated.
Kévin Debreux +7 more
wiley +1 more source
Resource assignments algorithm based on energy efficiency optimization in OFDM relay networks
Tongxin xuebao, 2015 In cooperative orthogonal frequency division multiplexing (OFDM) systems, the resource allocation rationally is significant to enhance the system performance. Aiming at maximizing the total system energy efficiency, the joint as-signment problem of relay,
Yun LI +3 more
doaj +2 more sources
Using Critical Sets for the Maximum Independent Set Problem Solving
, 2008 The problem of finding a maximum independent set in an undirected graph is a well known NP-hard problem. On the other hand, the critical independent set problem is polynomially solvable. The relationship between these two problems is studied and a method
Svyatoslav Trukhanov, Sergiy Butenko
core
Molecular Oncology, EarlyView.In the present work, we have identified a transcriptional signature based on the differential expression of six genes (BCL2&MAST4, HSH2D&LAT2, METRN&PITPNM2) that would facilitate the early detection of T‐cell acute lymphoblastic leukemia (T‐ALL) patients prone to a poor treatment response and could be implemented at diagnosis, along with other risk ...
Antonio Lahera +11 more
wiley +1 more source
Maximum independent sets near the upper bound [PDF]
Discrete Applied Mathematics, 2019 The size of a largest independent set of vertices in a given graph $G$ is denoted by $α(G)$ and is called its independence number (or stability number). Given a graph $G$ and an integer $K,$ it is NP-complete to decide whether $α(G) \geq K.$ An upper bound for the independence number $α(G)$ of a given graph $G$ with $n$ vertices and $m $ edges is given
openaire +3 more sources
In this paper, efforts are intensified as much as possible to explicitly and clearly give the definitions as regards the operations involving the complement, intersection as well as the union for IndetermSoft Set, IndetermHyperSoft Set, and Tree Soft Set
Adesina, Adebisi Sunday
core +1 more source
Modification of Robson's algorithm for finding maximum independent set in undirected graph [PDF]
, 2015 The problem of finding the maximum independent set of vertices in an undirected graph is considered.
Oksana S. Firyulina +3 more
core +1 more source