Results 181 to 190 of about 11,124 (213)
Rumor propagation dynamic analysis model based on hypergraph integration in public health events. [PDF]
Front Public HealthZhang M, Zhang X, Li F.
europepmc +1 more source
Strong Target Attack on Hypergraph Neural Networks via Label Poisoning and Structure Modification. [PDF]
Entropy (Basel)Huang J, Sun Q, Zhang N, Zheng M.
europepmc +1 more source
Hypergraph Semi-Supervised Contrastive Learning for Hyperedge Prediction Based on Enhanced Attention Aggregator. [PDF]
Entropy (Basel)Xie H, Song C, Shao H, Wang L.
europepmc +1 more source
HYG-mol: An Interpretable Multimodal Hypergraph Framework for Molecular Property Prediction. [PDF]
Comput Struct Biotechnol JMa J, Yang Q, Zhang L, Liu H, Zheng Y.
europepmc +1 more source
DHCLHAM: microbe-drug interaction prediction based on dual-hypergraph contrastive learning framework with hierarchical attention mechanism. [PDF]
Front MicrobiolHu H, Nie C.
europepmc +1 more source
Infection in hypergraphs [PDF]
Discrete Applied Mathematics, 2018 In this paper a new parameter for hypergraphs called hypergraph infection is defined. This concept generalizes zero forcing in graphs to hypergraphs. The exact value of the infection number of complete and complete bipartite hypergraphs is determined. A formula for the infection number for interval hypergraphs and several families of cyclic hypergraphs
Ferdinand Ihringer +2 more
exaly +4 more sources
Weak hypergraph regularity and linear hypergraphs
Journal of Combinatorial Theory Series B, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshiharu Kohayakawa +2 more
exaly +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Programming, 1997
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network
CAMBINI, RICCARDO +2 more
openaire +4 more sources
The matching polynomials of hypergraphs and weighted hypergraphs
Discrete Mathematics, Algorithms and Applications, 2022Let [Formula: see text] be the set of the connected [Formula: see text]-uniform linear hypergraphs with [Formula: see text] vertices, where [Formula: see text]. The matching polynomial of a hypergraph [Formula: see text] is denoted by [Formula: see text], where [Formula: see text]. Several properties on the roots of [Formula: see text] are derived. We
Jia-Wen Yang, Wen-Huan Wang
openaire +2 more sources
2016
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmová, Katerina +4 more
openaire +5 more sources
We introduce sequence hypergraphs by extending the concept of a directed edge (from simple directed graphs) to hypergraphs. Specifically, every hyperedge of a sequence hypergraph is defined as a sequence of vertices (imagine it as a directed path). Note that this differs substantially from the standard definition of directed hypergraphs.
Böhmová, Katerina +4 more
openaire +5 more sources