2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles
Summary: 2SCENT extends a static-cycle algorithm to enumerate all temporal cycles in directed interaction networks, with Bloom-filter-based root filtering to cut memory. It delivers up to 300× speedups over prior work and scales to millions of nodes and hundreds of millions of interactions, revealing temporal-cycle distributions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rohit Kumar
- 2. Toon Calders
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,534 | Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice | 2020 | VLDB | 6.1049756e-05 |
| 6,208 | PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration | 2021 | SIGMOD | 5.1568586e-05 |
| 9,089 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 4.39898e-05 |
| 10,258 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB | 4.1945683e-05 |
| 11,012 | Everest: GPU-Accelerated System For Mining Temporal Motifs | 2024 | VLDB | 4.1945683e-05 |
| 11,014 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,024 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00014609643 |
Previous
Page 1 / 1
Next