Finding and counting cliques and independent sets in r-uniform hypergraphs

We present a matrix multiplication based algorithm for counting the number of (induced) occurrences of a fixed r-uniform hypergraph in a larger hypergraph. In many cases, the running time is better than that of the na

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Raphael Yuster
• Keywords: Fixed R-uniform Hypergraph, Hypergraph, IPL 2006, Larger Hypergraph