Santos, D. S. d., Klamroth, K., Martins, P., & Paquete, L. (2024). Ensuring connectedness for the Maximum Quasi-clique and Densest $k$-subgraph problems.
Chicago Style (17th ed.) CitationSantos, Daniela Scherer dos, Kathrin Klamroth, Pedro Martins, and Luís Paquete. Ensuring Connectedness for the Maximum Quasi-clique and Densest $k$-subgraph Problems. 2024.
MLA (9th ed.) CitationSantos, Daniela Scherer dos, et al. Ensuring Connectedness for the Maximum Quasi-clique and Densest $k$-subgraph Problems. 2024.
Warning: These citations may not always be 100% accurate.