EUVIMEDEUVIMED entdecken
Crossref

Effective Durable Community Search in Large Temporal Graph

Yingli Zhou, Yige Jiang, Yixiang Fang, Wensheng Luo, Yongmin Hu, Yingqian Hu, Cheng Chen

Proceedings of the VLDB Endowment · 01.10.2025 · 19 (2) · 127-140

DOI: 10.14778/3773749.3773753 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the VLDB Endowment, online erschienen am 17.03.2026. Verfasst von Yingli Zhou und 6 weiteren Autor:innen. Die Arbeit nennt 100 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A temporal graph is an undirected graph where each edge is associated with a timestamp indicating when it occurs. As a fundamental topic in graph analysis, community search (CS) in temporal graphs has received much attention. Existing CS works on temporal graphs typically identify sets of vertices that form a k -core within a specific time window (temporal k -core). However, they overlook the duration of a temporal community, which is the continues time period that its members remain unchanged. Intuitively, the longer the duration of a temporal community, the higher its stability. Long-duration communities are useful in many areas, such as event detection and network analysis. In this paper, we introduce a novel community model, called temporal durable community (TDC), which is the temporal k -core with the longest duration in the temporal graph, and aim to efficiently find the TDC containing a query vertex. To solve this problem, we first propose a novel online algorithm based on binary search. We further develop two index structures that can quickly determine the duration of a given temporal k -core, followed by query algorithms. Experiments on ten real large temporal graphs show that our TDC model is effective for finding stable communities, and our index-based query algorithms are up to five orders of magnitude faster than the online algorithm.

Zitieren

APA

Zhou, Y., Jiang, Y., Fang, Y., Luo, W., Hu, Y., Hu, Y., & Chen, C. (2025). Effective Durable Community Search in Large Temporal Graph. Proceedings of the VLDB Endowment, 19(2), 127-140. https://doi.org/10.14778/3773749.3773753

Vancouver

Zhou Y, Jiang Y, Fang Y, Luo W, Hu Y, Hu Y, et al. Effective Durable Community Search in Large Temporal Graph. Proceedings of the VLDB Endowment. 2025;19(2):127-140. doi:10.14778/3773749.3773753

BibTeX
@article{Zhou2025,
  author = {Zhou, Yingli and Jiang, Yige and Fang, Yixiang and Luo, Wensheng and Hu, Yongmin and Hu, Yingqian and Chen, Cheng},
  title = {Effective Durable Community Search in Large Temporal Graph},
  journal = {Proceedings of the VLDB Endowment},
  year = {2025},
  volume = {19},
  number = {2},
  pages = {127--140},
  doi = {10.14778/3773749.3773753}
}
Kostenlos starten →