Results 111 to 120 of about 41,298 (230)

Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs

, 2021
Kasimir Gabert, Ali Pınar, Ümit V. Çatalyürek   +2 more
openalex   +2 more sources

Hypergraph Convolutional Network with Multi-perspective Topology Refinement forSkeleton-based Action Recognition [PDF]

Jisuanji kexue
Since the human skeleton is a natural topological structure,graph convolutional networks(GCNs) are widely used for skeleton-based human action recognition.In recent research,skeleton sequences are represented as spatio-temporal graphs and topology graphs
HUANG Qian, SU Xinkai, LI Chang, WU Yirui
doaj   +1 more source

Hypergraphs

, 2022
Given a family S of five subsets of a 10-set, suppose |A△B|≥6 for all different A,B∈S. Prove that |A△B|=6 for all different A,B∈S.
openaire   +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

AHD-SLE: Anomalous Hyperedge Detection on Hypergraph Symmetric Line Expansion

Axioms
Graph anomaly detection aims to identify unusual patterns or structures in graph-structured data. Most existing research focuses on anomalous nodes in ordinary graphs with pairwise relationships.
Yingle Li, Hongtao Yu, Haitao Li, Fei Pan, Shuxin Liu   +4 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

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

A Note on the Lagrangian of Linear 3-Uniform Hypergraphs [PDF]

, 2022
Sinan Hu, Biao Wu
openalex   +1 more source

The Existence of Quasi Regular and Bi-Regular Self-Complementary 3-Uniform Hypergraphs

Discussiones Mathematicae Graph Theory, 2016
A k-uniform hypergraph H = (V ;E) is called self-complementary if there is a permutation σ : V → V , called a complementing permutation, such that for every k-subset e of V , e ∈ E if and only if σ(e) ∉ E. In other words, H is isomorphic with H′ = (V ; V(
Kamble Lata N., Deshpande Charusheela M., Bam Bhagyashree Y.   +2 more
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