Results 81 to 90 of about 190,829 (309)

Recent Advances in Graph Partitioning

open access: yes, 2015
We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research ...
A Buluç   +128 more
core   +1 more source

Intein‐based modular chimeric antigen receptor platform for specific CD19/CD20 co‐targeting

open access: yesMolecular Oncology, EarlyView.
CARtein is a modular CAR platform that uses split inteins to splice antigen‐recognition modules onto a universal signaling backbone, enabling precise, scarless assembly without re‐engineering signaling domains. Deployed here against CD19 and CD20 in B‐cell malignancies, the design supports flexible multi‐antigen targeting to boost T‐cell activation and
Pablo Gonzalez‐Garcia   +9 more
wiley   +1 more source

Improving quality of graph partitioning using multilevel optimization

open access: yesТруды Института системного программирования РАН, 2018
Graph partitioning is required for solving tasks on graphs that need to be split across disks or computers. This problem is well studied, but most results are not suitable for processing graphs with billons of nodes on commodity clusters, since they ...
R. Pastukhov   +3 more
doaj   +1 more source

More Aspects of Arbitrarily Partitionable Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
A graph G of order n is arbitrarily partitionable (AP) if, for every sequence (n1, . . ., np) partitioning n, there is a partition (V1, . . ., ,Vp) of V (G) such that G[Vi] is a connected ni-graph for i = 1, . . ., p.
Bensmail Julien, Li Binlong
doaj   +1 more source

Domination in partitioned graphs [PDF]

open access: yesDiscussiones Mathematicae Graph Theory, 2002
Let \(V_1\), \(V_2\) be a bipartition of \(V(G)\) and let \(\gamma_i\) stand for the least number of vertices in the graph \(G\) needed to dominate \(V_i\). The authors prove that \(\gamma_1+ \gamma_2\leq{4\over 5}|V(G)|\) and conjecture that \(\gamma_1+\gamma_2\leq {4\over \delta+3} |V(G)|\) for graphs \(G\) of minimum degree \(\delta\leq 5\).
Tuza, Zsolt, Vestergaard, Preben Dahl
openaire   +2 more sources

Blocking the voltage‐gated sodium channel hNav1.5 as a novel pH‐dependent mechanism of action for tamoxifen

open access: yesFEBS Open Bio, EarlyView.
Patch‐clamp recordings revealed that tamoxifen inhibits voltage‐gated sodium channels, especially under acidic conditions, both common in metastatic cancer cells. These effects may explain certain antitumor properties of tamoxifen, highlighting a novel mechanism of action beyond its known endocrine effects.
Karl Josef Föhr   +5 more
wiley   +1 more source

Scalable parallel and distributed simulation of an epidemic on a graph.

open access: yesPLoS ONE, 2023
We propose an algorithm to simulate Markovian SIS epidemics with homogeneous rates and pairwise interactions on a fixed undirected graph, assuming a distributed memory model of parallel programming and limited bandwidth.
Guohao Dou
doaj   +1 more source

Tverberg Partition Graphs

open access: yesSIAM Journal on Discrete Mathematics
Given a finite set of points in $\mathbb{R}^d$, Tverberg's theorem guarantees the existence of partitions of this set into parts whose convex hulls intersect. We introduce a graph structured on the family of Tverberg partitions of a given set of points, whose edges describe closeness between different Tverberg partitions. We prove bounds on the minimum
Deborah Oliveros   +3 more
openaire   +3 more sources

Unfriendly partitions of a graph

open access: yesJournal of Combinatorial Theory, Series B, 1990
AbstractIt has been conjectured by Cowan and Emerson [3] that every graph has an unfriendly partition; i.e., there is a partition of the vertex set V = V0 ⌣ V1 such that every vertex of Vi is joined to at least as many vertices in V1−i as to vertices in Vi. It is easily seen that every finite graph has such a partition, and hence by compactness so does
Ron Aharoni, Karel Prikry, E. C. Milner
openaire   +2 more sources

Games induced by the partitioning of a graph [PDF]

open access: yesAnnals of Operations Research, 2012
The paper aims at generalizing the notion of restricted game on a communication graph, introduced by Myerson. We consider communication graphs with weighted edges, and we define arbitrary ways of partitioning any subset of a graph, which we call correspondences. A particularly useful way to partition a graph is obtained by computing the strength of the
Grabisch, Michel, Skoda, Alexandre
openaire   +5 more sources

Home - About - Disclaimer - Privacy