Endre Csóka, András Pongrácz. Finding cliques and dense subgraphs using edge queries. // Discrete Mathematics. – 2026. – DOI: 10.1016/j.disc.2026.115226. – URL: https://doi.org/10.1016/j.disc.2026.115226
Endre Csóka & András Pongrácz (2026). Finding cliques and dense subgraphs using edge queries. Discrete Mathematics. https://doi.org/10.1016/j.disc.2026.115226
Endre Csóka and András Pongrácz. “Finding cliques and dense subgraphs using edge queries.” Discrete Mathematics, 2026. doi:10.1016/j.disc.2026.115226.
@article{Cska2026,
title = {Finding cliques and dense subgraphs using edge queries},
author = {Csóka, Endre and Pongrácz, András},
journal = {Discrete Mathematics},
year = {2026},
doi = {10.1016/j.disc.2026.115226},
url = {https://doi.org/10.1016/j.disc.2026.115226}
}