[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/tcs/HorvathR10>
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.1016%2Fj.tcs.2010.03.030>
foaf:homepage <https://doi.org/10.1016/j.tcs.2010.03.030>
dc:identifier DBLP journals/tcs/HorvathR10 (xsd:string)
dc:identifier DOI doi.org%2F10.1016%2Fj.tcs.2010.03.030 (xsd:string)
dcterms:issued 2010 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/tcs>
rdfs:label Efficient frequent connected subgraph mining in graphs of bounded tree-width. (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:number 31-33 (xsd:string)
swrc:pages 2784-2797 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/tcs/HorvathR10/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/tcs/HorvathR10>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/tcs/tcs411.html#HorvathR10>
rdfs:seeAlso <https://doi.org/10.1016/j.tcs.2010.03.030>
dc:title Efficient frequent connected subgraph mining in graphs of bounded tree-width. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 411 (xsd:string)