Results 111 to 120 of about 11,124 (213)

Stable Hypergraph Matching in Unimodular Hypergraphs

CoRR
To be published at ICALP ...
Biró, Péter, Csáji, Gergely, Schlotter, Ildikó   +2 more
openaire   +4 more sources

The complexity of recognizing $ABAB$-free hypergraphs [PDF]

Discrete Mathematics & Theoretical Computer Science
The study of geometric hypergraphs gave rise to the notion of $ABAB$-free hypergraphs. A hypergraph $\mathcal{H}$ is called $ABAB$-free if there is an ordering of its vertices such that there are no hyperedges $A,B$ and vertices $v_1,v_2,v_3,v_4$ in this
Gábor Damásdi, Balázs Keszegh, Dömötör Pálvölgyi, Karamjeet Singh   +3 more
doaj   +1 more source

A note on self-complementary hypergraphs [PDF]

Opuscula Mathematica, 2005
In the paper we describe all self-complementary hypergraphs. It turns out that such hypergraphs exist if and only if the number of vertices of the hypergraph is of the form \(n=2^k\). This answers a conjecture posed by A.
Małgorzata Zwonek
doaj  

Interval hypergraphs and D-interval hypergraphs

Discrete Mathematics, 1977
AbstractA hypergraph H = (V, E) is called an interval hypergraph if there exists a one-to-one function ƒ mapping the elements of V to points on the real line such that for each edge E, there is an interval I, containing the images of all elements of E, but not the images of any elements not in E1.
openaire   +1 more source

Semantic Hypergraphs

CoRR, 2019
Approaches to Natural language processing (NLP) may be classified along a double dichotomy open/opaque - strict/adaptive. The former axis relates to the possibility of inspecting the underlying processing rules, the latter to the use of fixed or adaptive rules. We argue that many techniques fall into either the open-strict or opaque-adaptive categories.
Telmo L. T. Menezes, Camille Roth
openaire   +2 more sources

Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions

Entropy
Quantum contextuality plays a significant role in supporting quantum computation and quantum information theory. The key tools for this are the Kochen–Specker and non-Kochen–Specker contextual sets.
Mladen Pavičić
doaj   +1 more source

A Hypergraph Data Model for Expert-Finding in Multimedia Social Networks

Information, 2019
Online Social Networks (OSNs) have found widespread applications in every area of our life. A large number of people have signed up to OSN for different purposes, including to meet old friends, to choose a given company, to identify expert users about a ...
Flora Amato, Giovanni Cozzolino, Giancarlo Sperlì   +2 more
doaj   +1 more source

An introduction to hypergraphs

, 2005
This basically an exposition of sections 17.1 and 17.2 of the 17th chapter of the book entitled Graphs and Hypergraphs by Claude Berge. This paper mainly gives its readers basic background on the topic of hypergraphs, partial hypergraphs ...
Francisco, Joseph D.
core  

Connected components in networks with higher-order interactions

Journal of Physics: Complexity
We address the problem of defining connected components in hypergraphs, which are models for systems with higher-order interactions. For graphs with dyadic interactions, connected components are defined in terms of paths connecting nodes along the graph.
Gyeong-Gyun Ha, Izaak Neri, Alessia Annibale   +2 more
doaj   +1 more source

Hypergraph-of-entity.

Open Comput. Sci., 2019
Modern search is heavily powered by knowledge bases, but users still query using keywords or natural language. As search becomes increasingly dependent on the integration of text and knowledge, novel approaches for a unified representation of combined data present the opportunity to unlock new ranking strategies.
José Luís Devezas, Sérgio Nunes 0001
openaire   +2 more sources