Results 41 to 50 of about 14,658 (182)
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
PageRank algorithm for Directed Hypergraph [PDF]
, 2022 During the last two decades, we easilly see that the World Wide Web's link structure is modeled as the directed graph. In this paper, we will model the World Wide Web's link structure as the directed hypergraph.
Mai, An, Tran, Loc, Quan, Tho
core
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
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
A Note on Set Systems with no Union of Cardinality 0 modulo m [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Alon, Kleitman, Lipton, Meshulam, Rabin and Spencer (Graphs. Combin. 7 (1991), no. 2, 97-99) proved, that for any hypergraph F ={F 1,F 2,…, F d(q-1)+1 }, where q is a prime-power, and d denotes the maximal degree of the hypergraph, there exists
Vince Grolmusz
doaj +2 more sources
Nonclassical nullifiers for quantum hypergraph states [PDF]
QuantumQuantum hypergraph states form a generalisation of the graph state formalism that goes beyond the pairwise (dyadic) interactions imposed by remaining inside the Gaussian approximation.
Abhijith Ravikumar +2 more
doaj +1 more source
Partial Steiner Triple Systems With an Almost Parallel Class Missing Any Given Point
Journal of Combinatorial Designs, EarlyView.ABSTRACT We say that a hypergraph is factor critical if it has no 1‐factor but deletion of any vertex results in a hypergraph that has a 1‐factor. We show that any factor‐critical hypergraph of order n $n$ has at least n $n$ edges, and that for all integers k > 1 $k\gt 1$ and n > 1 $n\gt 1$ with n ≡ 1 ( mod k ) $n\equiv 1({\rm{mod}}\,k)$ there exists a
Darryn Bryant +2 more
wiley +1 more source
Hypergraph models of metabolism [PDF]
, 2014 In this paper, we employ a directed hypergraph model to investigate the extent to which environmental variability influences the set of available biochemical reactions within a living cell.
Crofts, JJ, Chuzhanova, N, Pearcy, N
core
Humanities & Social Sciences CommunicationsHigher-order relationships exist widely across different disciplines. In the realm of real-world systems, significant interactions involving multiple entities are common.
Bodian Ye +7 more
doaj +1 more source
The signless Laplacian matrix of hypergraphs
Special Matrices, 2022 In this article, we define signless Laplacian matrix of a hypergraph and obtain structural properties from its eigenvalues. We generalize several known results for graphs, relating the spectrum of this matrix to structural parameters of the hypergraph ...
Cardoso Kauê, Trevisan Vilmar
doaj +1 more source