Clique Lifting (Graph to Simplicial) - geometric-intelligence/TopoBench GitHub Wiki

The algorithm finds the cliques in the graph and creates simplices. Given a clique the first simplex added is the one containing all the nodes of the clique, then the simplices composed of all the possible combinations with one node missing, then two nodes missing, and so on, until all the possible pairs are added. Then the method moves to the next clique.

Reference: Simplicial Complexes