Results 71 to 80 of about 698,372 (216)

An Extended Formulation With Valid Inequalities for the Capacitated Steiner Arborescence Problem

Networks, Volume 88, Issue 2, Page 250-274, September 2026.
ABSTRACT Given a directed graph, the Capacitated Steiner Arborescence Problem (CSAP) aims to determine the least‐cost connection from the root node to terminal nodes requiring a demand through Steiner nodes coming with a capacity, such that there is a unique path from the root to each terminal. This paper presents a new extended formulation of the CSAP,
Francesco Contu, Massimo Di Francesco, Enrico Gorgone, Ishwar Murthy   +3 more
wiley   +1 more source

Hypergraph models of metabolism [PDF]

, 2014
In this paper, we employ a directed hypergraph model to investigate the extent to which environmental variability influences the set of available biochemical reactions within a living cell.
Crofts, JJ, Chuzhanova, N, Pearcy, N
core  

Single‐cell marker gene clustering: A unified deep learning framework for marker gene‐based clustering of single‐cell RNA‐sequencing data

Quantitative Biology, Volume 14, Issue 3, September 2026.
Abstract Single‐cell RNA sequencing (scRNA‐seq) has transformed the study of cellular heterogeneity by making it possible to classify individual cells and their functional states. However, the analysis remains difficult because high dropout rates lead to sparse and noisy expression data.
Shahriar Rahman Niloy, Toushif Muktashid Hasan, Md. Saiduzzaman Apu, Fahim Hafiz, Salekul Islam, Riasat Azim   +5 more
wiley   +1 more source

Transversals and domination in uniform hypergraphs

European Journal of Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Csilla Bujtás, Michael A. Henning, Zsolt Tuza   +2 more
openaire   +3 more sources

Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction

Advanced Science, Volume 13, Issue 46, 17 August 2026.
We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen, Guancen Lin, Chuan‐Shen Hu, Yong Wang   +3 more
wiley   +1 more source

ON THE SPECTRA OF TENSOR JOIN OF HYPERGRAPHS [PDF]

Journal of Algebraic Systems
In this paper, we consider certain classes of hypergraphs constructed from the tensor join of hypergraphs, specifically the tensor join of hypergraphs constrained by vertex subsets and the $(H, \mathcal{T}_{\mathcal{S}})$-join of hypergraphs constrained ...
Vishnupriya Ramkumar, Rajkumar Rajendran
doaj   +1 more source

Asymmetric Results About Graph Homomorphisms

Random Structures &Algorithms, Volume 69, Issue 1, August 2026.
ABSTRACT Many important results in extremal graph theory can be roughly summarized as “if a triangle‐free graph G$$ G $$ has certain properties, then it has a homomorphism to a triangle‐free graph Γ$$ \Gamma $$ of bounded size.” For example, bounds on homomorphism thresholds give such a statement if G$$ G $$ has sufficiently high minimum degree, and ...
Lior Gishboliner, Eoin Hurley, Yuval Wigderson   +2 more
wiley   +1 more source

Super edge-magic labeling of m-node k-uniform hyperpaths and m-node k-uniform hypercycles

AKCE International Journal of Graphs and Combinatorics, 2016
We generalize the notion of the super edge-magic labeling of graphs to the notion of the super edge-magic labeling of hypergraphs. For a hypergraph H with a finite vertex set V and a hyperedge set E, a bijective function f:V∪E→{1,2,3,…,|V|+|E|} is called
Ratinan Boonklurb, Authawich Narissayaporn, Sirirat Singhun   +2 more
doaj   +1 more source

Monochromatic loose paths in multicolored $k$-uniform cliques [PDF]

Discrete Mathematics & Theoretical Computer Science, 2019
For integers $k\ge 2$ and $\ell\ge 0$, a $k$-uniform hypergraph is called a loose path of length $\ell$, and denoted by $P_\ell^{(k)}$, if it consists of $\ell $ edges $e_1,\dots,e_\ell$ such that $|e_i\cap e_j|=1$ if $|i-j|=1$ and $e_i\cap e_j=\emptyset$
Andrzej Dudek, Andrzej Ruciński
doaj   +1 more source

The number of regular simplices in higher dimensions

Bulletin of the London Mathematical Society, Volume 58, Issue 8, August 2026.
Abstract We study the extremal function Sdk(n)$S^k_d(n)$, defined as the maximum number of regular (k−1)$(k-1)$‐simplices spanned by n$n$ points in Rd$\mathbb {R}^d$. For any fixed d⩾2k⩾6$d\geqslant 2k\geqslant 6$, we determine the asymptotic behavior of Sdk(n)$S^k_d(n)$ up to a lower‐order term.
Felix Christian Clemen, Adrian Dumitrescu, Dingyuan Liu   +2 more
wiley   +1 more source