Distributed discovery of frequent subgraphs of a network using MapReduce

DOI10.1007/s00607-015-0446-9zbMath1343.68284OpenAlexW2057114589MaRDI QIDQ889838

Saeed Shahrivari, Saeed Jalili

Publication date: 9 November 2015

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-015-0446-9

zbMATH Keywords

MapReducedistributed graph algorithmsfrequent subgraph discovery

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distributed algorithms (68W15)

Related Items (1)

A distributed approach for graph mining in massive networks

Uses Software

• MapReduce
• Hadoop
• Chord
• gSpan
• bliss
• FANMOD
• Kavosh

Cites Work

• Colorful triangle counting and a \textsc{MapReduce} implementation
• Complete mining of frequent patterns from graphs: Mining graph data
• Counting Triangles in Massive Graphs with MapReduce
• The NP-completeness column
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs

This page was built for publication: Distributed discovery of frequent subgraphs of a network using MapReduce