Results 71 to 80 of about 11,127 (100)

Matchings in balanced hypergraphs [PDF]

, 2011
The present work deals with the matching and vertex cover problem in balanced hypergraphs. This class of hypergraphs is, according to the definition by Berge in the 70s, one possible generalization of bipartite graphs.
Scheidweiler, Robert Berthold
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

HyperGodot: Interactive hypergraph visualization tool

SoftwareX
Hypergraphs provide a robust framework for modeling complex, multi-actor interactions that traditional graphs struggle to represent. In many real-world applications, interactions involve more than just pairs of entities, which makes hypergraphs an ...
Attila Ficsor, Timea Czvetko, Viktor Sebestyen, Janos Abonyi   +3 more
doaj   +1 more source

Finding the K shortest hyperpaths using reoptimization [PDF]

The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen ...
Andersen, Kim Allan, Nielsen, Lars Relund, Pretolani, Daniele   +2 more
core  

Entropy-based models to randomise real-world hypergraphs

Communications Physics
Network theory has often disregarded many-body relationships, solely focusing on pairwise interactions: neglecting them, however, can lead to misleading representations of complex systems.
Fabio Saracco, Giovanni Petri, Renaud Lambiotte, Tiziano Squartini   +3 more
doaj   +1 more source

Extending Graph-Based LP Techniques for Enhanced Insights Into Complex Hypergraph Networks

IEEE Access
Many real-world problems can be modelled in the form of complex networks. Social networks such as research collaboration networks and facebook, biological neural networks such as human brains, biomedical networks such as drug-target interactions and ...
Y. V. Nandini, T. Jaya Lakshmi, Murali Krishna Enduri, Hemlata Sharma, Mohd Wazih Ahmad   +4 more
doaj   +1 more source

Finding (s,d)-hypernetworks in F-hypergraphs is NP-hard

peer reviewedWe consider the problem of computing an (s,d)-hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem arising in directed hypergraphs, and is a foundational step in tackling problems of reachability and ...
Max Ward, GIL PONS, Reynaldo, Miller, Loïc, Reynaldo Gil-Pons, Loïc Miller, Ward, Max   +5 more
core   +1 more source

A counting lemma for sparse pseudorandom hypergraphs

, 2015
We establish so-called counting lemmas that allow embeddings of certain hyper-graphs into sparse "pseudorandom" hypergraphs. As an application, we present a variant of a universality result of Rödl for sparse, 3-uniform hypergraphs contained in strongly ...
Schacht, Mathias, Taraz, Anusch, Kohayakawa, Yoshiharu, Mota, Guilherme Oliveira   +3 more
core   +1 more source

Oriented hypergraphs

, 2010
The column dependencies of {0,±1}-matrices which contain at most two non-zero entries in each column have been characterized using orientations of graphs and signed graphs. We introduce a hypergraphic model of {0,±1}-matrices, called oriented hypergraphs,
Rusnak, Lucas J.
core  

A note on self-complementary hypergraphs

Tyt. z nagł.Abstract. In the paper we desribe 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 = 2k. This answers a conjecture posed by A. Szymański (see
Zwonek, Małgorzata.
core