"KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in ..."

Bintao Sun et al. (2020)

> Home

Details and statistics

DOI: 10.14778/3401960.3401962

access: open

type: Journal Article

metadata version: 2021-03-24

- view
  - electronic edition @ vldb.org (open access)
  - electronic edition via DOI
  authority control:
- export record
  dblp key:
  - journals/pvldb/SunDCS20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pvldb/SunDCS20
Bintao Sun, Maximilien Danisch, T.-H. Hubert Chan, Mauro Sozio:
KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. Proc. VLDB Endow. 13(10): 1628-1640 (2020)

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.