Results 191 to 200 of about 8,099 (222)
Enriched knowledge representation in biological fields: a case study of literature-based discovery in Alzheimer's disease. [PDF]
J Biomed SemanticsPu Y, Beck D, Verspoor K.
europepmc +1 more source
Hyperbolic multi-channel hypergraph convolutional neural network based on multilayer hypergraph. [PDF]
Sci RepBai L, Hu F, Tang C, Mei Z, Liu 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
Shaun Fallat +2 more
exaly +3 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 +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
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
SIAM Journal on Discrete Mathematics, 1996
A subsystem of an inconsistent set of inequalities is an irreducibly inconsistent subsystem (IIS) if it is inconsistent and if it has no inconsistent proper subsystem. Each IIS can be considered the edge of a hypergraph. The paper presents several properties of this special class of hypergraphs (IIS-hypergraphs).
openaire +1 more source
A subsystem of an inconsistent set of inequalities is an irreducibly inconsistent subsystem (IIS) if it is inconsistent and if it has no inconsistent proper subsystem. Each IIS can be considered the edge of a hypergraph. The paper presents several properties of this special class of hypergraphs (IIS-hypergraphs).
openaire +1 more source
Hypergraph isomorphism using association hypergraphs
Pattern Recognition Letters, 2019Abstract Association graphs represent a classical tool to deal with the graph matching problem and recently the idea has been generalized to the case of hypergraphs. In this article, the potential of this approach is explored. The proposed framework uses a class of dynamical systems derived from the Baum-Eagon inequality in order to find the maximum (
Giulia Sandi +2 more
openaire +1 more source
The Quarterly Journal of Mathematics, 1986
There is proved that every \((h+1)\)-uniform hypergraph H with \(\chi (H)=k\geq 3\) contains a cycle of length at least k and deduced the asymptotic behaviour of the maximum number of k-colourings in the class of all \((h+1)\)-hypergraphs of order n with \(\chi (H)=k\).
openaire +1 more source
There is proved that every \((h+1)\)-uniform hypergraph H with \(\chi (H)=k\geq 3\) contains a cycle of length at least k and deduced the asymptotic behaviour of the maximum number of k-colourings in the class of all \((h+1)\)-hypergraphs of order n with \(\chi (H)=k\).
openaire +1 more source