Work

An efficient algorithm for discovering frequent subgraphs

Year: 2004
Type: article
Language: English
Open Access status: closed
OpenAlex ID: W2168209541
FWCI: 48.38
Cites: 61
Cited by: 358
Related to: 10