Parallel Discovery of Top-k Weighted Motifs in Large Graphs
From MaRDI portal
Publication:6487411
DOI10.1007/978-3-031-15740-0_8zbMath1514.68062MaRDI QIDQ6487411
Unnamed Author, A. N. Papadopoulos
Publication date: 18 January 2023
Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
This page was built for publication: Parallel Discovery of Top-k Weighted Motifs in Large Graphs