Parallel Discovery of Top-k Weighted Motifs in Large Graphs (Q6487411): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding a Minimum Circuit in a Graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Main-memory triangle computations for very large (sparse (power-law)) graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Experimental and Efficient Algorithms / rank | |||
Normal rank | |||
Latest revision as of 11:49, 3 December 2024
scientific article; zbMATH DE number 7643333
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel Discovery of Top-k Weighted Motifs in Large Graphs |
scientific article; zbMATH DE number 7643333 |
Statements
Parallel Discovery of Top-k Weighted Motifs in Large Graphs (English)
0 references
18 January 2023
0 references
