2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles
Summary: 2SCENT enumerates all simple temporal cycles by extending a classic static-cycle algorithm with temporal ordering and Bloom-filter-based root filtering. It achieves up to 300× speedups over prior work and scales to millions of nodes and hundreds of millions of interactions. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Rohit Kumar (Universitat Politècnica de Catalunya (BarcelonaTech); Université Libre de Bruxelles)
- 2. Toon Calders (Universiteit Antwerpen; Université Libre de Bruxelles)
BibTeX Citation
@article{kumar_vldb18,
title = {{2SCENT: An Efficient Algorithm for Enumerating All Simple Temporal Cycles}},
author = {Kumar, Rohit and Calders, Toon},
journal = {PVLDB},
series = {{VLDB} '18},
volume = {11},
number = {11},
pages = {1441--1453},
doi = {10.14778/3236187.3236197},
url = {https://doi.org/10.14778/3236187.3236197},
year = {2018}
}Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,551 | Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice | 2020 | VLDB | 6.6355948e-05 |
| 5,938 | PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration | 2021 | SIGMOD | 6.0343238e-05 |
| 9,118 | Efficient Distributed Hop-Constrained Path Enumeration on Large-Scale Graphs | 2024 | SIGMOD | 5.3201316e-05 |
| 10,546 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB | 5.093636e-05 |
| 11,223 | Everest: GPU-Accelerated System For Mining Temporal Motifs | 2024 | VLDB | 5.093636e-05 |
| 11,225 | Efficient Regular Simple Path Queries under Transitive Restricted Expressions | 2024 | VLDB | 5.093636e-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,123 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00012089975 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,722 | Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming | 2021 | VLDB |
| 2 | 7,418 | Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale | 2022 | VLDB |
| 3 | 10,280 | Periodic Community Search in Temporal Graphs: Time Series-based Methods | 2026 | SIGMOD |
| 4 | 11,085 | Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks | 2025 | VLDB |
| 5 | 10,683 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD |
| 6 | 7,277 | Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments | 2012 | VLDB |
| 7 | 927 | Real-time Constrained Cycle Detection in Large Dynamic Graphs | 2018 | VLDB |
| 8 | 3,911 | Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs | 2024 | VLDB |
| 9 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 10 | 10,546 | TIMEST: Temporal Information Motif Estimator Using Sampling Trees | 2026 | VLDB |