BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs

Documenti analoghi

• Faster maximal clique enumeration in large real-world link streams
  di: Baudin, Alexis, et al.
  Pubblicazione: (2023)
• LSCPM: communities in massive real-world Link Streams by Clique Percolation Method
  di: Baudin, Alexis, et al.
  Pubblicazione: (2023)
• Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
  di: Basu, Sabyasachi, et al.
  Pubblicazione: (2024)
• Counting Graphlets of Size $k$ under Local Differential Privacy
  di: Suppakitpaisarn, Vorapong, et al.
  Pubblicazione: (2025)
• The Theory and Practice of Computing the Bus-Factor
  di: Piccolo, Sebastiano A., et al.
  Pubblicazione: (2026)