Study, representation and applications of hypergraph minimal transversals

02/03/2019
by   M. Nidhal Jelassi, et al.
0

This work is part of the field of the hypergraph theory and focuses on hypergraph minimal transversal. The problem of extracting the minimal transversals from a hypergraph received the interest of many researchers as shown the number of algorithms proposed in the literature, and this is mainly due to the solutions offered by the minimal transversal in various application areas such as databases, artificial intelligence, e-commerce, semantic web, etc. In view of the wide range of fields of minimal transversal application and the interest they generate, the objective of this thesis is to explore new application paths of minimal transversal by proposing methods to optimize the extraction. This has led to three proposed contributions in this thesis. The first approach takes advantage of the emergence of Web 2.0 and, therefore, social networks using minimal transversal for the detection of important actors within these networks. The second part of research in this thesis has focused on reducing the number of hypergraph minimal transversal. A concise and accurate representation of minimal transversal was proposed and is based on the construction of an irredundant hypergraph, hence are calculated the irredundant minimal transversal of the initial hypergraph. An application of this representation to the dependency inference problem is presented to illustrate the usefulness of this approach. The last approach includes the hypergraph decomposition into partial hypergraph the local minimal transversal are calculated and their Cartesian product can generate all the hypergraph transversal sets. Different experimental studies have shown the value of these proposed approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/24/2018

Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs

We bound the number of minimal hypergraph transversals that arise in tri...
research
03/14/2023

Enumerating all minimal hitting sets in polynomial total time

Consider a hypergraph (=set system) ℍ whose h hyperedges are subsets of ...
research
08/29/2019

PageRank algorithm for Directed Hypergraph

During the last two decades, we easilly see that the World Wide Web's li...
research
05/03/2018

On the Enumeration of Minimal Hitting Sets in Lexicographical Order

It is a long-standing open problem whether there exists an output-polyno...
research
07/29/2021

Towards a Survey on Static and Dynamic Hypergraph Visualizations

Leveraging hypergraph structures to model advanced processes has gained ...
research
12/29/2020

The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions

Constraint Satisfaction Problems (CSPs) play a central role in many appl...
research
04/01/2019

MESH: A Flexible Distributed Hypergraph Processing System

With the rapid growth of large online social networks, the ability to an...

Please sign up or login with your details

Forgot password? Click here to reset