Yang, Y., Ma, C., Cheng, R., Lakshmanan, L. V. S., & Han, X. (2025). Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density.
Cita Chicago Style (17a ed.)Yang, Yi, Chenhao Ma, Reynold Cheng, Laks V. S. Lakshmanan, y Xiaolin Han. Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density. 2025.
Cita MLA (9a ed.)Yang, Yi, et al. Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density. 2025.
Precaución: Estas citas no son 100% exactas.