Fast and Scalable Hashing-Based Universal Graph Coarsening
IEEE Transactions on Pattern Analysis and Machine Intelligence · 2026-08 · 48 (8) · 9245-9262
DOI: 10.1109/tpami.2026.3676633 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Pattern Analysis and Machine Intelligence, 2026-08. Verfasst von Mohit Kataria und 3 weiteren Autor:innen. Die Arbeit nennt 67 Literaturangaben. Gefördert von: Yardi-ScAI, IIT Delhi research fund.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Yardi-ScAI, IIT Delhi research fund
Zitieren
APA
Kataria, M., Malik, N., Jayadeva, & Kumar, S. (2026). Fast and Scalable Hashing-Based Universal Graph Coarsening. IEEE Transactions on Pattern Analysis and Machine Intelligence, 48(8), 9245-9262. https://doi.org/10.1109/tpami.2026.3676633
Vancouver
Kataria M, Malik N, Jayadeva, Kumar S. Fast and Scalable Hashing-Based Universal Graph Coarsening. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2026;48(8):9245-9262. doi:10.1109/tpami.2026.3676633
BibTeX
@article{Kataria2026,
author = {Kataria, Mohit and Malik, Nikita and Jayadeva and Kumar, Sandeep},
title = {Fast and Scalable Hashing-Based Universal Graph Coarsening},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
year = {2026},
volume = {48},
number = {8},
pages = {9245--9262},
doi = {10.1109/tpami.2026.3676633}
}
EUVIMED