Results 101 to 110 of about 2,959 (186)

The complexity of recognizing $ABAB$-free hypergraphs [PDF]

Discrete Mathematics & Theoretical Computer Science
The study of geometric hypergraphs gave rise to the notion of $ABAB$-free hypergraphs. A hypergraph $\mathcal{H}$ is called $ABAB$-free if there is an ordering of its vertices such that there are no hyperedges $A,B$ and vertices $v_1,v_2,v_3,v_4$ in this
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi, Karamjeet Singh   +3 more
doaj   +1 more source

Demonstration of hypergraph-state quantum information processing

Nature Communications
Complex entangled states are the key resources for measurement-based quantum computations, which is realised by performing a sequence of measurements on initially entangled qubits.
Jieshan Huang, Xudong Li, Xiaojiong Chen, Chonghao Zhai, Yun Zheng, Yulin Chi, Yan Li, Qiongyi He, Qihuang Gong, Jianwei Wang   +9 more
doaj   +1 more source

A class of inequalities relating degrees of adjacent nodes to the average degree in edge-weighted uniform hypergraphs

International Journal of Mathematics and Mathematical Sciences, 2005
In 1986, Johnson and Perry proved a class of inequalities for uniform hypergraphs which included the following: for any such hypergraph, the geometric mean over the hyperedges of the geometric means of the degrees of the nodes on the hyperedge is no less
P. D. Johnson, R. N. Mohapatra
doaj   +1 more source

Node Classification Method Based on Hierarchical Hypergraph Neural Network

Sensors
Hypergraph neural networks have gained widespread attention due to their effectiveness in handling graph-structured data with complex relationships and multi-dimensional interactions.
Feng Xu, Wanyue Xiong, Zizhu Fan, Licheng Sun   +3 more
doaj   +1 more source

Hypergraphs Accumulate

International Mathematics Research Notices
Abstract We showthat for every integer $k\geqslant 3$ the set of Turán densities of $k$-uniform hypergraphs has an accumulation point in $[0,1)$. In particular, $1/2$ is an accumulation point for the set of Turán densities of $3$-uniform hypergraphs.
Conlon, David, Schülke, Bjarne
openaire   +2 more sources

Hypergraph-of-entity.

Open Comput. Sci., 2019
Modern search is heavily powered by knowledge bases, but users still query using keywords or natural language. As search becomes increasingly dependent on the integration of text and knowledge, novel approaches for a unified representation of combined data present the opportunity to unlock new ranking strategies.
José Luís Devezas, Sérgio Nunes 0001
openaire   +2 more sources

Cover-free families on hypergraphs and combinatorial group testing. [PDF]

J Comb Optim
Idalino TB, Moura L.
europepmc   +1 more source

Information theory for hypergraph similarity. [PDF]

Sci Adv
Felippe H, Kirkley A, Battiston F.
europepmc   +1 more source

HIBMatch: Hypergraph Information Bottleneck for Semi-Supervised Alzheimer's Progression. [PDF]

IEEE J Biomed Health Inform
Deng Z, Wang S, Aviles-Rivero AI, Kourtzi Z, Schonlieb CB.   +4 more
europepmc   +1 more source

HKD-CPI: high-order knowledge distillation enhanced inductive compound-protein interaction prediction. [PDF]

Bioinformatics
He Z, Liu X, Jiang Y, Xu J, Lin Y, Jin S, Wei L, Wang Y.   +7 more
europepmc   +1 more source