%0 Conference Paper %1 conf/enc/Gutierrez-SotoCA08 %A Gutiérrez-Soto, Claudio %A Campos, Pedro G. %A Aguila, Julio %B ENC %D 2008 %E Gelbukh, Alexander F. %E Adiba, Michel E. %I IEEE Computer Society %K %P 232-237 %T Longest Path Subgraph: A Novel and Efficient Algorithm to Match RDF Graphs. %U http://dblp.uni-trier.de/db/conf/enc/enc2008.html#Gutierrez-SotoCA08 %@ 978-0-7695-3439-8

@inproceedings{conf/enc/Gutierrez-SotoCA08, added-at = {2023-12-13T04:04:53.000+0100}, author = {Gutiérrez-Soto, Claudio and Campos, Pedro G. and Aguila, Julio}, biburl = {https://www.bibsonomy.org/bibtex/223b27975c5ff792dfcce895e545ded6e/admin}, booktitle = {ENC}, crossref = {conf/enc/2008}, editor = {Gelbukh, Alexander F. and Adiba, Michel E.}, ee = {http://doi.ieeecomputersociety.org/10.1109/ENC.2008.41}, interhash = {91b4f4fff983ade046e641ccff840028}, intrahash = {23b27975c5ff792dfcce895e545ded6e}, isbn = {978-0-7695-3439-8}, keywords = {}, pages = {232-237}, publisher = {IEEE Computer Society}, timestamp = {2023-12-13T04:04:53.000+0100}, title = {Longest Path Subgraph: A Novel and Efficient Algorithm to Match RDF Graphs.}, url = {http://dblp.uni-trier.de/db/conf/enc/enc2008.html#Gutierrez-SotoCA08}, year = 2008 }