KHop Lifting (Graph to Hypergraph) - geometric-intelligence/TopoBench GitHub Wiki

For each node in the graph, the algorithm finds the set of nodes that are at most k connections away from the initial node. This set is then used to create an hyperedge. The process is repeated for all nodes in the graph.

Reference: Hypergraph Learning: Methods and Practices