Finding Heaviest k-Subgraphs and Events in Social Media - Télécom Paris Access content directly
Conference Papers Year : 2016
Not file

Dates and versions

hal-02412324 , version 1 (15-12-2019)

Identifiers

  • HAL Id : hal-02412324 , version 1

Cite

Letsios Matthaios, Oana D. Balalau, Maximilien Danisch, Emmanuel Orsini, Mauro Sozio. Finding Heaviest k-Subgraphs and Events in Social Media. ICDM Workshop, Feb 2016, Barcelona, Spain. ⟨hal-02412324⟩
33 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More