High-performance parallel frequent subgraph discovery

Discovery of frequent subgraphs of an input network is one of the most important facilities for mining and analyzing complex networks. The most accurate solution to frequent subgraph discovery is to enumerate all subgraphs of size k and then count the frequency of each isomorphic class. However, the...

Full description

Bibliographic Details

Published in:	The Journal of supercomputing Vol. 71; no. 7; pp. 2412 - 2432
Main Authors:	Shahrivari, Saeed, Jalili, Saeed
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.07.2015
Subjects:	Compilers Computer Science Interpreters Processor Architectures Programming Languages Parallel frequent subgraph discovery Multicore processing Parallel graph algorithms
ISSN:	0920-8542, 1573-0484
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!