[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/pkdd/HorvathR08>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jan_Ramon>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Tam%C3%A1s_Horv%C3%A1th_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-87479-9%5F52>
foaf:homepage <https://doi.org/10.1007/978-3-540-87479-9_52>
dc:identifier DBLP conf/pkdd/HorvathR08 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-87479-9%5F52 (xsd:string)
dcterms:issued 2008 (xsd:gYear)
rdfs:label Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jan_Ramon>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Tam%C3%A1s_Horv%C3%A1th_0001>
swrc:pages 520-535 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/pkdd/2008-1>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/pkdd/HorvathR08/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/pkdd/HorvathR08>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/pkdd/pkdd2008-1.html#HorvathR08>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-87479-9_52>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/pkdd>
dc:title Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document