Results 111 to 120 of about 10,205 (230)

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  

Hypergraph Learning: From Algorithms to Applications

Graphs are a general language for describing and modeling interconnected systems. To learn graph data, Graph Neural Networks (GNNs) have been introduced.
Saifuddin, Khaled Mohammed
core   +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

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

Assigning entities to teams as a hypergraph discovery problem

Communications Physics
Assigning agents to teams under strict task and effort constraints is crucial in business, science, and engineering, where disruptions can cause significant losses.
Guilherme Ferraz de Arruda, Wan He, Nasimeh Heydaribeni, Tara Javidi, Yamir Moreno, Tina Eliassi-Rad   +5 more
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

Lines in hypergraphs

Combinatorica, 2013
One of the De Bruijn - Erdos theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs
Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky, Vasek Chvátal, Nicolas Fraiman, Yori Zwols   +7 more
openaire   +3 more sources

Learning a Hidden Hypergraph [PDF]

, 2005
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergraph or not.
Jiang Chen, Dana Angluin
core   +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

Transformations on hypergraph families

, 2023
We present a new general theory of function-based hypergraph transformations on finite families of finite hypergraphs. A function-based hypergraph transformation formalises the action of structurally modifying hypergraphs from a family in a consistent ...
Vittadello, Sean Trinity
core