Results 191 to 200 of about 11,124 (213)
Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions.
Alexander Scott
exaly +4 more sources
Constructing cospectral hypergraphs [PDF]
Spectral hypergraph theory mainly concerns using hypergraph spectra to obtain structural information about the given hypergraphs. The study of cospectral hypergraphs is important since it reveals which hypergraph properties cannot be deduced from their ...
Aida Abiad, Antonina P Khramova
exaly +5 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more sources
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 +2 more sources
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
2008 IEEE International Symposium on Information Theory, 2008
A generalization of codes on regular bipartite graphs is given by a family of codes on hypergraphs. We derive the average weight distribution and estimate the minimum distance of codes in the random ensemble of hypergraph codes. We also propose an iterative decoding algorithm of hypergraph codes that corrects a larger proportion of errors than known ...
Alexander Barg, Gilles Zémor
openaire +1 more source
A generalization of codes on regular bipartite graphs is given by a family of codes on hypergraphs. We derive the average weight distribution and estimate the minimum distance of codes in the random ensemble of hypergraph codes. We also propose an iterative decoding algorithm of hypergraph codes that corrects a larger proportion of errors than known ...
Alexander Barg, Gilles Zémor
openaire +1 more source
Hypergraph Neural Networks for Hypergraph Matching
2021 IEEE/CVF International Conference on Computer Vision (ICCV), 2021Xiaowei Liao, Yong Xu 0007, Haibin Ling
openaire +2 more sources
Distances in Higher-Order Networks and the Metric Structure of Hypergraphs
Entropy, 2023Miguel Romance +2 more
exaly
2005
A notion of satisfiability on hypergraphs is introduced and some existence problems are shown to be instances of the satisfiability on appropriate hypergraphs. Then a hypergraph based interpretation of propositional connectives is defined. This interpretation unexpectably turns out to be adequate for the Intuitionistic Propositional Calculus.
openaire +2 more sources
A notion of satisfiability on hypergraphs is introduced and some existence problems are shown to be instances of the satisfiability on appropriate hypergraphs. Then a hypergraph based interpretation of propositional connectives is defined. This interpretation unexpectably turns out to be adequate for the Intuitionistic Propositional Calculus.
openaire +2 more sources
The structure of hypergraphs without long Berge cycles
Journal of Combinatorial Theory Series B, 2021Ervin Gyori, Nika Salia, Oscar Zamora
exaly

