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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	The Journal of supercomputing Jg. 71; H. 7; S. 2412 - 2432
Hauptverfasser:	Shahrivari, Saeed, Jalili, Saeed
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.07.2015
Schlagworte:	Compilers Computer Science Interpreters Processor Architectures Programming Languages Parallel frequent subgraph discovery Multicore processing Parallel graph algorithms
ISSN:	0920-8542, 1573-0484
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!