Results 101 to 110 of about 14,658 (182)
Hypergraph Convolutional Network with Multi-perspective Topology Refinement forSkeleton-based Action Recognition [PDF]
Jisuanji kexueSince 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
How to pick your football team
Mathematika, Volume 72, Issue 4, October 2026.Abstract Team captains Alice and Bob divide up 2m$2m$ footballers, each reduced to a real‐valued score, into two teams of m$m$ footballers each. On each turn, one captain plays picker, and the other chooser: the picker names a footballer yet to be selected, and the chooser decides which captain's team receives that footballer.
Bhargav Narayanan
wiley +1 more source
AHD-SLE: Anomalous Hyperedge Detection on Hypergraph Symmetric Line Expansion
AxiomsGraph 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 +4 more
doaj +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. +2 more
doaj +1 more source
3-Zero-Divisor Hypergraph with Respect to an Element in Multiplicative Lattice
Cumhuriyet Science Journal, 2019 Let be a multiplicative lattice and be a proper element of . We introduce the3-zero-divisor hypergraph of with respect to which is a hypergraph whose vertices areelements of the set where distinct vertices and are adjacent, that is, is a hyperedge if and
Gülşen Ulucak
doaj +1 more source
Simonovits's theorem in random graphs
Proceedings of the London Mathematical Society, Volume 133, Issue 4, October 2026.Abstract Let H$H$ be a graph with χ(H)=r+1$\chi (H) = r+1$. Simonovits's theorem states that, if H$H$ is edge‐critical, the unique largest H$H$‐free subgraph of Kn$K_n$ is its largest r$r$‐partite subgraph, provided that n$n$ is sufficiently large. We show that the same holds with Kn$K_n$ replaced by the binomial random graph Gn,p$G_{n,p}$ whenever H$H$
Ilay Hoshen, Wojciech Samotij
wiley +1 more source
Hypergraph Rewriting Using Conformisms
, 1995 In this paper we study single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, [2,4]. As an application, single-pushout transformation in a category of hypergraphs with a special type of ...
Monserrat Rossell'o +3 more
core +2 more sources
Consequence Operators Based on
, 2008 Four consequence operators based on hypergraph satisfiability are defi-ned. Their properties are explored and interconnections are displayed. Finally their relation to the case of the Classical Propositional Calculus is shown. 1. Preliminaries.
Adam Kolany, Hypergraph Satisfiability
core
Demonstration of hypergraph-state quantum information processing
Nature CommunicationsComplex 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 +9 more
doaj +1 more source
The complexity of recognizing $ABAB$-free hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe 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 +3 more
doaj +1 more source