Detecting maximum-durable structures on temporal graphs

Open Webpage

Faming Li, Zhaonian Zou, Xianmin Liu, Jianzhong Li, Xiaochun Yang, Bin Wang

Published: 01 Jan 2023, Last Modified: 06 Nov 2025Knowl. Based Syst. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: In this paper, we study the problem of detecting maximum k-durable structures on temporal graphs, which can be used to mine and analyze more knowledge behind the temporal graphs. We first prove that this problem is NP-complete and hard to approximate. Next, we propose an efficient algorithm to detect maximum k-durable structures. The algorithm accelerates the detection process by using an auxiliary graph and several well-designed pruning strategies. Massive experiments on five large temporal social networks demonstrate that our algorithm can save 2–4 orders of magnitude number of recursive invocation and is at least 30×<math><mo is="true">×</mo></math> faster than the baseline algorithm.