Results 131 to 140 of about 11,124 (213)
AbstractUn hypergraphe arboré est l'hypergraphe d'une familie de sous-arbres d'un arbre. Un hypergraphe est arboré si, et seulement si, il a la propriété de Helly et sa représentation triangulée; cette derniére propriété est ensuite remplacée par une condition sur les cycles de l'hypergraphe.
openaire +1 more source
PROPERTIES OF BIPOLAR FUZZY HYPERGRAPHS
In this article, we apply the concept of bipolar fuzzy sets to hypergraphs and investigate some properties of bipolar fuzzy hypergraphs. We introduce the notion of A− tempered bipolar fuzzy hypergraphs and present some of their properties. We
Akram, M., Sarwar, S., Dudek, W.A.
core
We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a hypergraph H and denoted by `c(H).
openaire +2 more sources
Higher-order trade-offs in hypergraph community detection. [PDF]
Li J, Schaub MT, Peel L.
europepmc +1 more source
Hyperedge approximation for stochastic processes on higher-order networks. [PDF]
Sheng A +5 more
europepmc +1 more source
PMPIHGLL: predicting metabolite-protein interactions using dual hypergraph convolutional networks and large language models. [PDF]
Chen L, Jin Z, Shao Y, Zhou B.
europepmc +1 more source
Information theory for hypergraph similarity. [PDF]
Felippe H, Kirkley A, Battiston F.
europepmc +1 more source
Cover-free families on hypergraphs and combinatorial group testing. [PDF]
Idalino TB, Moura L.
europepmc +1 more source
CCLPH: community-centric approach to link prediction in hyper complex networks. [PDF]
Nandini YV +3 more
europepmc +1 more source
DDEC: Dual Dependency-Enhanced Contrastive Learning for Sparse Hypergraph Node Classification. [PDF]
Liu M, Zheng W, Yuan S.
europepmc +1 more source

