Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles
Jovan Blanuša(IBM Research - Zurich), Paolo Ienne(École Polytechnique Fédérale de Lausanne), Kubilay Atasu(IBM Research - Zurich)
Cited by 0
Related Papers
Provably Powerful Graph Neural Networks for Directed Multigraphs
|Proceedings of the AAAI Conference on Artificial Intelligence|2024|21
Manycore clique enumeration with fast set intersections
|Proceedings of the VLDB Endowment|2020|20
Graph Feature Preprocessor: Real-time Subgraph-based Feature Extraction for Financial Crime Detection
|Unknown|2024|15
Realistic Synthetic Financial Transactions for Anti-Money Laundering Models
|arXiv (Cornell University)|2023|14
Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-constrained Cycles
|ACM Transactions on Parallel Computing|2023|8