Distributed discovery of frequent subgraphs of a network using MapReduce (Q889838): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Complete mining of frequent patterns from graphs: Mining graph data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The NP-completeness column / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting Triangles in Massive Graphs with MapReduce / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Colorful triangle counting and a \textsc{MapReduce} implementation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs / rank | |||
Normal rank | |||
Revision as of 00:39, 11 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Distributed discovery of frequent subgraphs of a network using MapReduce |
scientific article |
Statements
Distributed discovery of frequent subgraphs of a network using MapReduce (English)
0 references
9 November 2015
0 references
frequent subgraph discovery
0 references
distributed graph algorithms
0 references
MapReduce
0 references
