%0 Conference Paper %1 conf/mco/VismaraV08 %A Vismara, Philippe %A Valery, Benoît %B MCO %D 2008 %E An, Le Thi Hoai %E Bouvry, Pascal %E Tao, Pham Dinh %I Springer %K dblp %P 358-368 %T Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms. %U http://dblp.uni-trier.de/db/conf/mco/mco2008.html#VismaraV08 %V 14 %@ 978-3-540-87476-8

@inproceedings{conf/mco/VismaraV08, added-at = {2017-05-21T00:00:00.000+0200}, author = {Vismara, Philippe and Valery, Benoît}, biburl = {https://www.bibsonomy.org/bibtex/2ff1611d02dc121e85e9a2cd1656dea47/dblp}, booktitle = {MCO}, crossref = {conf/mco/2008}, editor = {An, Le Thi Hoai and Bouvry, Pascal and Tao, Pham Dinh}, ee = {https://doi.org/10.1007/978-3-540-87477-5_39}, interhash = {63179d28e8aa493216b9b5ff5b4ab091}, intrahash = {ff1611d02dc121e85e9a2cd1656dea47}, isbn = {978-3-540-87476-8}, keywords = {dblp}, pages = {358-368}, publisher = {Springer}, series = {Communications in Computer and Information Science}, timestamp = {2017-05-24T08:20:34.000+0200}, title = {Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms.}, url = {http://dblp.uni-trier.de/db/conf/mco/mco2008.html#VismaraV08}, volume = 14, year = 2008 }