An efficient algorithm for discovering frequent subgraphs. Kuramochi, M. & Karypis, G. IEEE Trans Knowl Data En, 16(9):1038–1051, 2004. bibtex @Article{kuramochi04efficient,
author = {Michihiro Kuramochi and George Karypis},
title = {An efficient algorithm for discovering frequent subgraphs},
journal = {IEEE Trans Knowl Data En},
year = {2004},
volume = {16},
number = {9},
pages = {1038--1051},
keywords = {substructure},
owner = {fhufsky},
timestamp = {2012.07.27},
}
Downloads: 0
{"_id":"obi52BP8DmpNWN2SZ","bibbaseid":"kuramochi-karypis-anefficientalgorithmfordiscoveringfrequentsubgraphs-2004","authorIDs":[],"author_short":["Kuramochi, M.","Karypis, G."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Michihiro"],"propositions":[],"lastnames":["Kuramochi"],"suffixes":[]},{"firstnames":["George"],"propositions":[],"lastnames":["Karypis"],"suffixes":[]}],"title":"An efficient algorithm for discovering frequent subgraphs","journal":"IEEE Trans Knowl Data En","year":"2004","volume":"16","number":"9","pages":"1038–1051","keywords":"substructure","owner":"fhufsky","timestamp":"2012.07.27","bibtex":"@Article{kuramochi04efficient,\n author = {Michihiro Kuramochi and George Karypis},\n title = {An efficient algorithm for discovering frequent subgraphs},\n journal = {IEEE Trans Knowl Data En},\n year = {2004},\n volume = {16},\n number = {9},\n pages = {1038--1051},\n keywords = {substructure},\n owner = {fhufsky},\n timestamp = {2012.07.27},\n}\n\n","author_short":["Kuramochi, M.","Karypis, G."],"key":"kuramochi04efficient","id":"kuramochi04efficient","bibbaseid":"kuramochi-karypis-anefficientalgorithmfordiscoveringfrequentsubgraphs-2004","role":"author","urls":{},"keyword":["substructure"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:50:42.272Z","downloads":0,"keywords":["substructure"],"search_terms":["efficient","algorithm","discovering","frequent","subgraphs","kuramochi","karypis"],"title":"An efficient algorithm for discovering frequent subgraphs","year":2004,"dataSources":["C5FtkvWWggFfMJTFX"]}