HL-index for Hypergraph Reachability

This paper addresses the computationally challenging problem of reachability in hypergraphs, which are crucial for modeling complex relationships beyond pairwise interactions. The introduction of the HL-index and its associated optimization techniques (covering relationship detection, neighbor-index) offers a novel approach to efficiently answer max-reachability queries. The focus on scalability and efficiency, validated by experiments on 20 datasets, makes this research significant for real-world applications.

• •Addresses the problem of reachability in hypergraphs, which are important for modeling complex relationships.
• •Introduces the HL-index, a novel vertex-to-hyperedge index for efficient max-reachability queries.
• •Employs optimization techniques like covering relationship detection and a neighbor-index to improve efficiency.
• •Demonstrates efficiency and scalability through experiments on 20 datasets.