Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

A fast algorithm for mining frequent subgraphs

From MaRDI portal
Publication:5188877
Jump to:navigation, search

DOI10.3724/SP.J.1087.2008.02533zbMath1181.68175MaRDI QIDQ5188877

Wu Jia

Publication date: 6 March 2010

Published in: Journal of Computer Applications (Search for Journal in Brave)



zbMATH Keywords

graphisomorphismdata miningassociated matrix


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)








This page was built for publication: A fast algorithm for mining frequent subgraphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5188877&oldid=19770970"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 16:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki