Longest Path Subgraph: A Novel and Efficient Algorithm to Match RDF Graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/enc/Gutierrez-SotoCA08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/enc/Gutierrez-SotoCA08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Claudio_Guti%E2%88%9A%C2%A9rrez-Soto
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Julio_Aguila
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Pedro_G._Campos
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FENC.2008.41
>
foaf:
homepage
<
https://doi.org/10.1109/ENC.2008.41
>
dc:
identifier
DBLP conf/enc/Gutierrez-SotoCA08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FENC.2008.41
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
Longest Path Subgraph: A Novel and Efficient Algorithm to Match RDF Graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Claudio_Guti%E2%88%9A%C2%A9rrez-Soto
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Julio_Aguila
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Pedro_G._Campos
>
swrc:
pages
232-237
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/enc/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/enc/Gutierrez-SotoCA08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/enc/Gutierrez-SotoCA08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/enc/enc2008.html#Gutierrez-SotoCA08
>
rdfs:
seeAlso
<
https://doi.org/10.1109/ENC.2008.41
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/enc
>
dc:
title
Longest Path Subgraph: A Novel and Efficient Algorithm to Match RDF Graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document