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

Celý popis

Podrobná bibliografia

Vydané v:	The Journal of supercomputing Ročník 71; číslo 7; s. 2412 - 2432
Hlavní autori:	Shahrivari, Saeed, Jalili, Saeed
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.07.2015
Predmet:	Compilers Computer Science Interpreters Processor Architectures Programming Languages Parallel frequent subgraph discovery Multicore processing Parallel graph algorithms
ISSN:	0920-8542, 1573-0484
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!