Finding Heaviest k-Subgraphs and Events in Social Media

Letsios Matthaios; Oana D. Balalau; Maximilien Danisch; Emmanuel Orsini; Mauro Sozio

Conference papers

Finding Heaviest k-Subgraphs and Events in Social Media

Letsios Matthaios Oana D. Balalau ^{1, 2} Maximilien Danisch ^{1, 2} Emmanuel Orsini Mauro Sozio ^{1, 2}

1 DIG - Data, Intelligence and Graphs

LTCI - Laboratoire Traitement et Communication de l'Information

2 INFRES - Département Informatique et Réseaux

Document type :

Conference papers

Domain :

Computer Science [cs]

Complete list of metadata

https://hal.telecom-paris.fr/hal-02412324
Contributor : TelecomParis HAL Connect in order to contact the contributor
Submitted on : Sunday, December 15, 2019 - 12:58:40 PM
Last modification on : Wednesday, November 3, 2021 - 8:18:54 AM

Finding Heaviest k-Subgraphs and Events in Social Media

Identifiers

Collections

Citation

Export

Metrics

33

Finding Heaviest k-Subgraphs and Events in Social Media

Identifiers

Collections

Citation

Export

Share

Metrics

33