Open Access · CC BY 4.0
Finding cliques and dense subgraphs using edge queries
Discrete Mathematics · 2026-10 · 349 (10) · 115226
DOI: 10.1016/j.disc.2026.115226 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-10. Verfasst von Endre Csóka und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Research Development and Innovation Office, European Research Council.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Research Development and Innovation Office
- European Research Council
Zitieren
APA
Csóka, E., & Pongrácz, A. (2026). Finding cliques and dense subgraphs using edge queries. Discrete Mathematics, 349(10), 115226. https://doi.org/10.1016/j.disc.2026.115226
Vancouver
Csóka E, Pongrácz A. Finding cliques and dense subgraphs using edge queries. Discrete Mathematics. 2026;349(10):115226. doi:10.1016/j.disc.2026.115226
BibTeX
@article{Cska2026,
author = {Csóka, Endre and Pongrácz, András},
title = {Finding cliques and dense subgraphs using edge queries},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {10},
pages = {115226},
doi = {10.1016/j.disc.2026.115226}
}
EUVIMED