Results 51 to 60 of about 1,956 (175)

Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number

Journal of Graph Theory, Volume 112, Issue 3, Page 337-351, July 2026.
ABSTRACT We continue the study of ( tw , ω )‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by Dallard, Milanič, and Štorgel ...
Claire Hilaire, Martin Milanič, Ðorđe Vasić   +2 more
wiley   +1 more source

Predicting SARS‐CoV‐2 Infection With Graph Attention Capsule Networks

Computational Intelligence, Volume 42, Issue 3, June 2026.
ABSTRACT Recent studies in machine learning have demonstrated the effectiveness of applying graph neural networks (GNNs) to single‐cell RNA sequencing (scRNA‐seq) data to predict COVID‐19 disease states. In this study, we propose an explainable graph attention capsule network (GACapNet), which extracts and fuses Severe Acute Respiratory Syndrome ...
Runjie Zhu, Jimmy Xiangji Huang, Amran Bhuiyan, Zhiwen Xie, Guangyou Zhou   +4 more
wiley   +1 more source

Accelerating Subgraph Matching Through Advanced Compression and Label Filtering

Algorithms
Efficiently identifying subgraphs that match a given query graph within large-scale graphs has become a critical focus in both academic and industrial research.
Yanfeng Chai, Jiashu Li, Qiang Zhang
doaj   +1 more source

R Package FrF2 for Creating and Analyzing Fractional Factorial 2-Level Designs

Journal of Statistical Software, 2014
This article describes the R package FrF2 for design and analysis of experiments with 2-level factors. The package offers both regular and non-regular fractional factorial 2-level designs, in the regular case with blocking and split plot facilities and ...
Ulrike Grömping
doaj   +1 more source

The N‐prime graph and the Subgroup Isomorphism Problem

Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.
Abstract We introduce a directed graph related to a group G$G$, which we call the N‐prime graph ΓN(G)$\Gamma _{\rm {N}}(G)$ of G$G$ and is a refinement of the classical Gruenberg–Kegel graph. The vertices of ΓN(G)$\Gamma _{\rm {N}}(G)$ are the primes p$p$ such that G$G$ has an element of order p$p$, and, for distinct vertices p$p$ and q$q$, the arc q→p$
Emanuele Pacifici, Ángel del Río, Marco Vergani   +2 more
wiley   +1 more source

GRAPES-DD: exploiting decision diagrams for index-driven search in biological graph databases

BMC Bioinformatics, 2021
Background Graphs are mathematical structures widely used for expressing relationships among elements when representing biomedical and biological information. On top of these representations, several analyses are performed. A common task is the search of
Nicola Licheri, Vincenzo Bonnici, Marco Beccuti, Rosalba Giugno   +3 more
doaj   +1 more source

Generalized free wreath products and their operator algebras

Journal of the London Mathematical Society, Volume 113, Issue 6, June 2026.
Abstract We develop a new approach on free wreath products, generalizing the constructions of Bichon and of Fima‐Pittau. We show stability properties for certain approximation properties such as exactness, Haagerup property, hyperlinearity, and K‐amenability. We study qualitative properties of the associated von Neumann algebra: factoriality, primeness,
Pierre Fima, Arthur Troupel
wiley   +1 more source

Application of dynamic expansion tree for finding large network motifs in biological networks [PDF]

PeerJ, 2019
Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks,
Sabyasachi Patra, Anjali Mohapatra
doaj   +2 more sources

The geometry of zonotopal algebras II: Orlik–Terao algebras and Schubert varieties

Proceedings of the London Mathematical Society, Volume 132, Issue 6, June 2026.
Abstract Zonotopal algebras, introduced by Postnikov–Shapiro–Shapiro, Ardila–Postnikov, and Holtz–Ron, show up in many different contexts, including approximation theory, representation theory, Donaldson–Thomas theory, and hypertoric geometry. In the first half of this paper, we construct a perfect pairing between the internal zonotopal algebra of a ...
Colin Crowley, Nicholas Proudfoot
wiley   +1 more source

Polynomial-time algorithms for Subgraph Isomorphism in small graph classes of perfect graphs [PDF]

, 2016
Given two graphs, Subgraph Isomorphism is the problem of deciding whether the first graph (the base graph) contains a subgraph isomorphic to the second graph (the pattern graph).
Otachi, Yota, Uehara, Ryuhei, Konagaya, Matsuo   +2 more
core   +1 more source