"Efficient 𝑘-Clique Densest Subgraph Discovery: Towards Bridging ..."

Yingli Zhou, Qingshuo Guo, Yixiang Fang (2025)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2025-09-25

- view
  - electronic edition @ vldb.org (open access)
- export record
  dblp key:
  - journals/pvldb/ZhouGF25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pvldb/ZhouGF25
Yingli Zhou, Qingshuo Guo, Yixiang Fang:
Efficient 𝑘-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory. Proc. VLDB Endow. 18(10): 3490-3503 (2025)

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.