Parallel Discovery of Top-k Weighted Motifs in Large Graphs

DOI10.1007/978-3-031-15740-0_8MaRDI QIDQ6487411zbMATH OpenFDO

Authors A. N. Papadopoulos

Publication date 18 January 2023

Full work available at URL https://doi.org/10.1007/978-3-031-15740-0_8

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Fast analytical methods for finding significant labeled graph motifs
• Motif discovery in networks: a survey
• Fast methods for finding significant motifs on labelled multi-relational networks
• Mining top-\(k\) motifs with a SAT-based framework
• Approaches to parallel graph-based knowledge discovery
• An algorithmic framework for motif discovery problems in weighted sequences
• Finding approximate and constrained motifs in graphs
• Finding approximate and constrained motifs in graphs

Cites work

• Experimental and Efficient Algorithms
• Finding a Minimum Circuit in a Graph
• Main-memory triangle computations for very large (sparse (power-law)) graphs

Cited in

(3)

• Finding top-N colossal patterns based on clique search with dynamic update of graph
• Fast methods for finding significant motifs on labelled multi-relational networks
• Engineering Motif Search for Large Graphs

This page was built for publication: Parallel Discovery of Top-k Weighted Motifs in Large Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6487411)