Results 251 to 260 of about 56,011 (266)
Some of the next articles are maybe not open access.
HypeBoy: Generative Self-Supervised Representation Learning on Hypergraphs
International Conference on Learning RepresentationsHypergraphs are marked by complex topology, expressing higher-order interactions among multiple nodes with hyperedges, and better capturing the topology is essential for effective representation learning.
Sunwoo Kim +5 more
semanticscholar +1 more source
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à, Kateřina +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à, Kateřina +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
Random Hypergraph Irregularity
SIAM Journal on Discrete Mathematics, 2016Summary: A hypergraph is \(k\)-irregular if there is no set of \(k\) vertices all of which have the same degree. We asymptotically determine the probability that a random uniform hypergraph is \(k\)-irregular.
Balister, Paul +3 more
openaire +1 more source
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
Colorful hypergraphs in Kneser hypergraphs
2013Using a $Z_q$-generalization of a theorem of Ky Fan, we extend to Kneser hypergraphs a theorem of Simonyi and Tardos that ensures the existence of multicolored complete bipartite graphs in any proper coloring of a Kneser graph. It allows to derive a lower bound for the local chromatic number of Kneser hypergraphs (using a natural definition of what can
openaire +1 more source