Scalable Temporal Motif Densest Subnetwork Discovery

Documenti analoghi

• Efficient and Adaptive Estimation of Local Triadic Coefficients
  di: Sarpe, Ilie, et al.
  Pubblicazione: (2025)
• Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
  di: Venturin, Giorgio, et al.
  Pubblicazione: (2025)
• Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
  di: Zhang, Guangyi, et al.
  Pubblicazione: (2025)
• OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
  di: Tu, Sijing, et al.
  Pubblicazione: (2025)
• The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
  di: Lu, Qiheng, et al.
  Pubblicazione: (2025)