Algorithms and Data Structures for Hyperedge Queries - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles ACM Journal of Experimental Algorithmics Year : 2022

Algorithms and Data Structures for Hyperedge Queries


We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, given a hypergraph, we need to answer queries of the form: “Does the following set of vertices form a hyperedge in the given hypergraph?” Our aim is to set up data structures based on hashing to answer these queries as fast as possible. We propose an adaptation of a well-known perfect hashing approach for the problem at hand. We analyze the space and runtime complexity of the proposed approach and experimentally compare it with the state-of-the-art hashing-based solutions. Experiments demonstrate the efficiency of the proposed approach with respect to the state-of-the-art.
Fichier principal
Vignette du fichier
hedge-main.pdf (1.27 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03905905 , version 1 (19-12-2022)



Jules Bertrand, Fanny Dufossé, Somesh Singh, Bora Uçar. Algorithms and Data Structures for Hyperedge Queries. ACM Journal of Experimental Algorithmics, 2022, 27, pp.1-23. ⟨10.1145/3568421⟩. ⟨hal-03905905⟩
69 View
61 Download



Gmail Facebook X LinkedIn More