How to efficiently count maximal cliques in uniform hypergraphs
A r-uniform hypergraph is like a graph, but edges are defined as being sets of r nodes. I.e., a graph is a 2-uniform hypergraph.
A r-uniform hypergraph is like a graph, but edges are defined as being sets of r nodes. I.e., a graph is a 2-uniform hypergraph.