Scalable mining of large disk-based graph databases
Authors:
Open Access
- 22 August 2004
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 316-325
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Graph indexing2004
- CloseGraph2003
- Efficiently mining frequent trees in a forest2002
- An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data2000
- An algorithm for the multiple common subgraph problemJournal of Chemical Information and Computer Sciences, 1992
- Recognition of Largest Common Structural Fragment among a Variety of Chemical StructuresAnalytical Sciences, 1987