Finding Approximate and Constrained Motifs in Graphs

Riccardo Dondi, Guillaume Fertin, Stéphane Vialette. Finding Approximate and Constrained Motifs in Graphs. In Raffaele Giancarlo, Giovanni Manzini, editors, Combinatorial Pattern Matching - 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings. Volume 6661 of Lecture Notes in Computer Science, pages 388-401, Springer, 2011. [doi]

Abstract

Abstract is missing.