Russian Doll Search algorithm is a branching algorithm for finding hereditary structures in a simple, undirected graph.
Project page: GitHub
Formal paper: Here
Build status: 
TODO write about algo and how to use the code.
A simple, undirected graph is the set of vertices V and the set of edges between them E.
f(x) = x^2 \sum\limits_{i=0}^{\infty}\left\{\frac{a}{b}\right\}
f(x) = x^2 \sum\limits_{i=0}^{\infty}\left\{\frac{a}{b}\right\}