An efficient algorithm for discovering frequent subgraphs
Year: 2004
Type: article
DOI: 10.1109/tkde.2004.33
Authors: M. Kuramochi, G. Karypis
Institution: University of Minnesota
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed
Funders: Yale University, Army Research Office
OpenAlex ID: W2168209541
