"Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph ..."

Daniela Scherer dos Santos et al. (2024)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2403.08534

access: open

type: Informal or Other Publication

metadata version: 2025-04-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2403-08534
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2403-08534
Daniela Scherer dos Santos, Kathrin Klamroth, Pedro Martins, Luís Paquete:
Ensuring connectedness for the Maximum Quasi-clique and Densest k-subgraph problems. CoRR abs/2403.08534 (2024)

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.