"Fully Dynamic Algorithm for Top-k Densest Subgraphs."

Muhammad Anis Uddin Nasir et al. (2017)

> Home

Details and statistics

DOI: 10.1145/3132847.3132966

access: closed

type: Conference or Workshop Paper

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cikm/NasirGMG17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cikm/NasirGMG17
Muhammad Anis Uddin Nasir, Aristides Gionis, Gianmarco De Francisci Morales, Sarunas Girdzijauskas:
Fully Dynamic Algorithm for Top-k Densest Subgraphs. CIKM 2017: 1817-1826

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.