README.md

This project hosts the code for finding densest common subgraph in a relational graph set. For more details, please see the following poster and the accompanying paper.