Finding top-N colossal patterns based on clique search with dynamic update of graph

DOI10.1007/978-3-642-29892-9_23zbMATH Open1360.68819OpenAlexW41264102MaRDI QIDQ2907473FDOQ2907473

Authors: Yoshiaki Okubo, Makoto Haraguchi 

Publication date: 10 September 2012

Published in: Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29892-9_23

Recommendations

• Enumerating maximal cliques in large sparse graphs
• scientific article; zbMATH DE number 1424314
• Parallel maximum clique algorithms with applications to network analysis
• Parallel Discovery of Top-k Weighted Motifs in Large Graphs
• Mining maximal hyperclique pattern: a hybrid search strategy

zbMATH Keywords

cliquespattern graphcolossal patternsmaximal patterns

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Knowledge representation (68T30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

This page was built for publication: Finding top-\(N\) colossal patterns based on clique search with dynamic update of graph

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