# Mantis-shrimp

Implementation of our algorithm that counts patterns in degenerate graphs. In particular, it can compute the VC-dimension more efficiently if the graph is sufficiently sparse.

Implementation of our algorithm that counts patterns in degenerate graphs. In particular, it can compute the VC-dimension more efficiently if the graph is sufficiently sparse.

Felix is a Senior Lecturer at Birkbeck. His speciality is the design of algorithms for sparse graphs.

Patrick is an Algo Lab PhD student. He is working on researching and implementing algorithms to compute sparsity measures.