.png){kind=icon}
Return
Detecting maximum k-durable structures on temporal graphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2023.110561.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 30x faster than the baseline algorithm.(c) 2023 Elsevier B.V. All rights reserved.
Keywords:
Temporal graph
Durable structure
Parameterized complexity
Biclique
Journal
K
IF:
7.6
Papers:
1.3W
Citations:
4.5W
Organization
View more organizations
Cited Papers
ShareSave
255 Mechanotranscription Plays a Critical Role in Smooth Muscle Hyperplasia in Bowel Obstruction
PREAI
ShareSaveShareSaveOptimised Anaesthesia to Reduce Post Operative Cognitive Decline (POCD) in Older Patients Undergoing Elective Surgery, a Randomised Controlled Trial.png)
PLoS ONE
OAAI
PLoS ONEIF0
OAAIShareSaveTertiary structures of amyloidogenic and non-amyloidogenic transthyretin variants: new model for amyloid fibril formationAmyloid
AmyloidIF0
PREAI
ShareSave View more