Finding approximate and constrained motifs in graphs

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Finding approximate and constrained motifs in graphs. Theoretical Computer Science, 483:10-21, 2013. [doi]

Abstract

Abstract is missing.