%0 Conference Paper %1 conf/cpm/DondiFV11 %A Dondi, Riccardo %A Fertin, Guillaume %A Vialette, Stéphane %B CPM %D 2011 %E Giancarlo, Raffaele %E Manzini, Giovanni %I Springer %K dblp %P 388-401 %T Finding Approximate and Constrained Motifs in Graphs. %U http://dblp.uni-trier.de/db/conf/cpm/cpm2011.html#DondiFV11 %V 6661 %@ 978-3-642-21457-8

@inproceedings{conf/cpm/DondiFV11, added-at = {2017-06-15T00:00:00.000+0200}, author = {Dondi, Riccardo and Fertin, Guillaume and Vialette, Stéphane}, biburl = {https://www.bibsonomy.org/bibtex/2c5ad61a6da5197bcfc278f2b4393ddaa/dblp}, booktitle = {CPM}, crossref = {conf/cpm/2011}, editor = {Giancarlo, Raffaele and Manzini, Giovanni}, ee = {https://doi.org/10.1007/978-3-642-21458-5_33}, interhash = {95dfc5f96bc0e4947054448e050aabe5}, intrahash = {c5ad61a6da5197bcfc278f2b4393ddaa}, isbn = {978-3-642-21457-8}, keywords = {dblp}, pages = {388-401}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T13:48:17.000+0200}, title = {Finding Approximate and Constrained Motifs in Graphs.}, url = {http://dblp.uni-trier.de/db/conf/cpm/cpm2011.html#DondiFV11}, volume = 6661, year = 2011 }