Results 91 to 100 of about 11,124 (213)
Edge intersection hypergraphs [PDF]
If \( \mathcal{H}=(V, \mathcal{E} ) \) is a hypergraph, its edge intersection hypergraph \( EI( \mathcal{H} )=(V, \mathcal{E}^{EI} ) \) has the edge set \( \mathcal{E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in \mathcal{E} \ \wedge \ e_1 \neq e_2 \ \wedge ...
Teichert, Hanns-Martin, Sonntag, Martin
core +1 more source
Study on the reliability of hypergraphs based on non-backtracking matrix centrality
网络与信息安全学报In recent years, there has been widespread attention on hypergraphs as a research hotspot in network science.The unique structure of hypergraphs, which differs from traditional graphs, is characterized by hyperedges that can connect multiple nodes ...
Hao PENG, Cheng QIAN, Dandan ZHAO, Ming ZHONG, Jianmin HAN, Ziyi XIE, Wei WANG
doaj +3 more sources
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 +3 more
wiley +1 more source
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 +5 more
wiley +1 more source
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Barry Guiduli, Zoltán Király
openaire +2 more sources
Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves
Journal of the London Mathematical Society, Volume 114, Issue 3, September 2026.Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena +1 more
wiley +1 more source
Matchings in balanced hypergraphs [PDF]
, 2011 The present work deals with the matching and vertex cover problem in balanced hypergraphs. This class of hypergraphs is, according to the definition by Berge in the 70s, one possible generalization of bipartite graphs.
Scheidweiler, Robert Berthold
core
Beyond directed hypergraphs: heterogeneous hypergraphs and spectral centralities [PDF]
The study of hypergraphs has received a lot of attention over the past few years, however up until recently there has been no interest in systems where higher order interactions are not undirected. In this article we introduce the notion of heterogeneous
Criado, Regino +2 more
core +1 more source
Tool & library to visualize and edit sourced labelled hypergraphs,compute their treewidth, decompose them into prime ...
Pous, Damien
core +6 more sources