The complexity of mining maximal frequent subgraphs. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/pods/KimelfeldK13>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Benny_Kimelfeld>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Phokion_G._Kolaitis>
foaf:homepage	<http://dx.doi.org/doi.org%2F10.1145%2F2463664.2465222>
foaf:homepage	<https://doi.org/10.1145/2463664.2465222>
dc:identifier	DBLP conf/pods/KimelfeldK13 (xsd:string)
dc:identifier	DOI doi.org%2F10.1145%2F2463664.2465222 (xsd:string)
dcterms:issued	2013 (xsd:gYear)
rdfs:label	The complexity of mining maximal frequent subgraphs. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Benny_Kimelfeld>
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Phokion_G._Kolaitis>
swrc:pages	13-24 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/pods/2013>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/pods/KimelfeldK13/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/pods/KimelfeldK13>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/pods/pods2013.html#KimelfeldK13>
rdfs:seeAlso	<https://doi.org/10.1145/2463664.2465222>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/pods>
dc:title	The complexity of mining maximal frequent subgraphs. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document