Results 41 to 50 of about 14,067 (220)
MSHC: a multi-stage hypergraph clustering algorithm
Shenzhen Daxue xuebao. Ligong banAs a high-dimensional extension of ordinary graphs, hypergraphs can more flexibly reflect high-order complex relationships between nodes. Hypergraph clustering aims to discover complex high-order correlations in powerful hypergraph structures.
ZHANG Chunying +4 more
doaj +1 more source
Journal of Pure and Applied Algebra, 2019 38 ...
Brendan Fong, David I. Spivak
openaire +4 more sources
Hypernetwork science via high-order hypergraph walks
EPJ Data Science, 2020 We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width.
Sinan G. Aksoy +4 more
doaj +1 more source
Discussiones Mathematicae Graph Theory, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Garske +2 more
openaire +4 more sources
An Efficient Algorithm for the Transversal Hypergraph Generation
Journal of Graph Algorithms and Applications, 2005 The Transversal Hypergraph Generation is the problem of generating, given a hypergraph, the set of its minimal transversals, i.e., the hypergraph whose hyperedges are the minimal hitting sets of the given one.
Dimitris Kavvadias, Elias Stavropoulos
doaj +1 more source
Random Structures & Algorithms, 2012 AbstractThis paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turán's theorem, which deals with graphs G = ([n],E) such that no member of the restriction set \documentclass{article} \usepackage ...
Peter Allen 0001 +3 more
openaire +3 more sources
Sheaf Hypergraph Networks [PDF]
, 2023 Higher-order relations are widespread in nature, with numerous phenomena involving complex interactions that extend beyond simple pairwise connections.
Giulia Cassarà +3 more
core +1 more source
Convex Cone Conditions on the Structure of Designs [PDF]
, 2003 Various known and original inequalities concerning the structure of combinatorial designs are established using polyhedral cones generated by incidence matrices. This work begins by giving definitions and elementary facts concerning t-designs.
Dukes, Peter James
core +1 more source
Magic of quantum hypergraph states [PDF]
QuantumMagic, or nonstabilizerness, characterizes the deviation of a quantum state from the set of stabilizer states, playing a fundamental role in quantum state complexity and universal fault-tolerant quantum computing.
Junjie Chen, Yuxuan Yan, You Zhou
doaj +1 more source
Self-Supervised Multi-Channel Hypergraph Convolutional Network for Social Recommendation
, 2021 Social relations are often used to improve recommendation quality when user-item interaction data is sparse in recommender systems. Most existing social recommendation models exploit pairwise relations to mine potential user preferences.
Zhang, Xiangliang +12 more
core +1 more source