Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation

Summary: EF-Index compresses connectivity of temporal k-cores into minimal MTSFs and retrieves interval MTSFs in optimal time via a time→topology kernel. Adds time–topology isomorphism to k-core evolution, supports incremental updates, achieving 1–3 orders speedup and 4–5 orders space reduction. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13693
Venue: VLDB
Year: 2024
Pagerank: 5.3774243e-05
Overall Rank: 8,718 | 40.19%
DOI: 10.14778/3681954.3681967

Incoming Non-self Citations Over Time

Authors

1. Junyong Yang (Wuhan University)
2. Ming Zhong (Wuhan University)
3. Yuanyuan Zhu (Wuhan University)
4. Tieyun Qian (Wuhan University)
5. Mengchi Liu (South China Normal University)
6. Jeffrey Xu Yu (Chinese University of Hong Kong)

BibTeX Citation

@article{yang_vldb24,
        title = {{Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation}},
        author = {Yang, Junyong and Zhong, Ming and Zhu, Yuanyuan and Qian, Tieyun and Liu, Mengchi and Yu, Jeffrey Xu},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {11},
        pages = {2840--2853},
        doi = {10.14778/3681954.3681967},
        url = {https://doi.org/10.14778/3681954.3681967},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,812	On More Efficiently and Versatilely Querying Historical k-Cores	2025	VLDB	5.3652966e-05
10,280	Periodic Community Search in Temporal Graphs: Time Series-based Methods	2026	SIGMOD	5.093636e-05
10,283	Querying Cohesive Subgraphs in Temporal Graphs	2026	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
189	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026114928
1,123	Path Problems in Temporal Graphs	2014	VLDB	0.00012089975
1,378	Effective Community Search over Large Spatial Graphs	2017	VLDB	0.00010971508
1,647	Effective and Efficient Community Search over Large Heterogeneous Information Networks	2020	VLDB	0.00010125633
2,826	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	8.0865974e-05
2,896	Online Density Bursting Subgraph Detection from Temporal Graphs	2019	VLDB	7.9828452e-05
3,312	On Querying Historical K-Cores	2021	VLDB	7.5309892e-05
3,337	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	7.5072753e-05
3,737	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	7.1609645e-05
3,836	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD	7.0827068e-05
3,911	Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs	2024	VLDB	7.0240227e-05
5,408	Reliable Community Search in Dynamic Networks	2022	VLDB	6.2280384e-05
6,635	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	5.8174952e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,528	Effective Durable Community Search in Large Temporal Graph	2026	VLDB
2	3,312	On Querying Historical K-Cores	2021	VLDB
3	8,149	Efficient Index for Temporal Core Queries over Bipartite Graphs	2024	VLDB
4	5,540	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD
5	10,283	Querying Cohesive Subgraphs in Temporal Graphs	2026	SIGMOD
6	3,836	On Querying Connected Components in Large Temporal Graphs	2023	SIGMOD
7	8,812	On More Efficiently and Versatilely Querying Historical k-Cores	2025	VLDB
8	6,635	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB
9	9,072	Time-Topology Analysis	2021	VLDB
10	6,075	On Querying Historical Connectivity in Temporal Graphs	2024	SIGMOD