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]

Authors

Riccardo Dondi

This author has not been identified. Look up 'Riccardo Dondi' in Google

Guillaume Fertin

This author has not been identified. Look up 'Guillaume Fertin' in Google

Stéphane Vialette

This author has not been identified. Look up 'Stéphane Vialette' in Google