"On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms."

Karthekeyan Chandrasekaran et al. (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.APPROX/RANDOM.2024.9

access: open

type: Conference or Workshop Paper

metadata version: 2024-09-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/approx/ChandrasekaranC24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/ChandrasekaranC24
Karthekeyan Chandrasekaran, Chandra Chekuri, Manuel R. Torres, Weihao Zhu:
On the Generalized Mean Densest Subgraph Problem: Complexity and Algorithms. APPROX/RANDOM 2024: 9:1-9:21

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.