Recent Advances in Efficient Dynamic Graph Processing

Graph as one of the most fundamental and representative data structures has found a wide spectrum of emerging application domains such as social media, financial transactions, biology science, and road networks. Recently, with the proliferation of graph applications, graph processing has attracted m...

Full description

Saved in:
Bibliographic Details
Published in:Applied sciences Vol. 15; no. 11; p. 6003
Main Authors: Chen, Zi, Liang, Keke, Yuan, Long, Zhang, Wenjie, Yang, Zhengyi
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.06.2025
Subjects:
Advertising
Algorithms
dynamic graph algorithms
Efficiency
fully graph update
graph analysis
Graph coloring
Graph representations
Proteins
Social media
Social network analysis
Social networks
Surveys
system
United States
ISSN:2076-3417, 2076-3417
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Graph as one of the most fundamental and representative data structures has found a wide spectrum of emerging application domains such as social media, financial transactions, biology science, and road networks. Recently, with the proliferation of graph applications, graph processing has attracted much attention in both industry and academia. Among them, most existing works focus on the static graphs in which the vertices and edges are immutable. However, in the real world, graphs are constantly and dynamically changing, bringing tricky challenges to process such dynamic graphs. This paper surveys the recent advances in dynamic graph processing, including centrality, graph coloring, cohesive subgraph, path traversal, and graph separation. We summarize the computational complexity models for dynamic algorithm analysis, theoretically compare the efficiency of algorithms among different research topics. Moreover, we also explore the research opportunities for the future.
AbstractList Graph as one of the most fundamental and representative data structures has found a wide spectrum of emerging application domains such as social media, financial transactions, biology science, and road networks. Recently, with the proliferation of graph applications, graph processing has attracted much attention in both industry and academia. Among them, most existing works focus on the static graphs in which the vertices and edges are immutable. However, in the real world, graphs are constantly and dynamically changing, bringing tricky challenges to process such dynamic graphs. This paper surveys the recent advances in dynamic graph processing, including centrality, graph coloring, cohesive subgraph, path traversal, and graph separation. We summarize the computational complexity models for dynamic algorithm analysis, theoretically compare the efficiency of algorithms among different research topics. Moreover, we also explore the research opportunities for the future.
Audience Academic
Author Zhang, Wenjie
Yang, Zhengyi
Chen, Zi
Yuan, Long
Liang, Keke
Author_xml – sequence: 1
  givenname: Zi
  orcidid: 0000-0001-5608-4555
  surname: Chen
  fullname: Chen, Zi
– sequence: 2
  givenname: Keke
  surname: Liang
  fullname: Liang, Keke
– sequence: 3
  givenname: Long
  orcidid: 0000-0001-8111-0401
  surname: Yuan
  fullname: Yuan, Long
– sequence: 4
  givenname: Wenjie
  orcidid: 0000-0001-6572-2600
  surname: Zhang
  fullname: Zhang, Wenjie
– sequence: 5
  givenname: Zhengyi
  orcidid: 0000-0003-1772-6863
  surname: Yang
  fullname: Yang, Zhengyi
BookMark eNptkVtLAzEQhYMoeOuTf2DBR2nNZZNsHot3EBTpe5jNZmpKTdbsKvjvTa2CiMlDwuF8J5OZQ7IbU_SEnDA6E8LQc-h7JhlTlIodcsCpVlNRM737675PJsOwomUZJhpGD4h88s7HsZp37xCdH6oQqyvE4MJGvfyI8BJcdZOhf64ecyqOIcTlMdlDWA9-8n0ekcX11eLidnr_cHN3Mb-fuprKcco5Ou8a39UcvWg7rRxHIzoJXGltsGG1kEYh1Q4Nbx0iZcA9tG0jjQRxRO62sV2Cle1zeIH8YRME-yWkvLSQx-DW3vryiuykVHVLa4MIoLTyHrAz0GjqStbpNqvP6fXND6NdpbccS_VWcKY135RUXLOtawklNERMYwZXdudLH0q_MRR93tSSGqoaWgC2BVxOw5A9WhdGGEOKBQxry6jdDMf-Gk5hzv4wP1_7z_0Jv0WQoQ
CitedBy_id crossref_primary_10_1016_j_future_2025_108097
Cites_doi 10.1007/978-3-319-25730-3
10.1016/0304-3975(95)00079-8
10.1145/564913.564917
10.14778/3389133.3389142
10.1109/ACCESS.2024.3476159
10.3390/a10030102
10.1109/TKDE.2023.3311398
10.14778/3358701.3358706
10.1109/IPDPSW63119.2024.00063
10.1109/TKDE.2013.2297918
10.1016/j.ins.2014.10.015
10.1137/1.9781611974331.ch52
10.1109/CSNT.2011.137
10.1109/ICDM.2013.135
10.24963/ijcai.2019/313
10.1145/2623330.2623674
10.1016/0020-0190(87)90095-0
10.1007/978-3-031-30675-4_10
10.1145/2588555.2612182
10.1109/TCSS.2020.3026574
10.1145/3669906
10.1145/2660460.2660465
10.1109/MITS.2014.2324000
10.1007/978-3-642-31464-3_29
10.1007/978-3-319-32149-3_20
10.1007/s11280-016-0421-1
10.1007/978-3-031-30675-4_18
10.1145/2213836.2213854
10.1016/S0020-0190(96)00202-5
10.14778/3364324.3364329
10.14778/2904483.2904486
10.1145/3366423.3380119
10.1145/2588555.2612181
10.1145/2508020.2489791
10.1145/1321440.1321520
10.1109/TCSS.2021.3064836
10.1145/3035918.3035944
10.1007/978-3-662-48054-0_9
10.14778/3551793.3551840
10.1016/0304-3975(94)90159-7
10.1109/SC.2016.29
10.1007/978-3-030-59416-9_29
10.1145/3605573.3605597
10.1016/0020-0190(85)90024-9
10.1145/3357713.3384236
10.1145/3380936
10.1007/s41060-021-00303-y
10.1007/s00778-021-00681-6
10.1007/s00778-019-00566-9
10.1109/HPEC.2018.8547518
10.1109/TKDE.2017.2772233
10.1145/362248.362272
10.1007/978-3-030-32591-6_35
10.1109/TKDE.2013.158
10.1007/s00778-019-00540-5
10.1007/978-3-319-03536-9_14
10.3390/a12030052
10.1137/1.9781611977912.122
10.1109/ICDE.2017.136
10.1137/1.9781611975031.1
10.1109/TMSCS.2018.2802920
10.1109/TC.2008.198
10.1109/PDP.2016.109
10.1007/s11704-023-2656-1
10.1007/s11227-024-06367-4
10.1137/1.9781611975482.117
10.1007/978-1-0716-3327-4
10.1007/978-3-030-59416-9_32
10.1145/3564246.3585105
10.1080/0022250X.2001.9990249
10.1145/2556195.2556213
10.1023/B:COAP.0000008651.28952.b6
10.1109/TKDE.2022.3219096
10.1137/1.9781611974782.166
10.1145/2806416.2806424
10.1145/3097983.3097995
10.1145/358746.358755
10.1145/2492517.2500270
10.1007/s00778-020-00606-9
10.1109/CLUSTER.2013.6702680
10.1137/0203006
10.1145/3589132.3625647
10.1007/978-3-319-49487-6_4
10.1109/TKDE.2023.3346377
10.1504/IJAACS.2024.137062
10.1145/2463676.2465315
10.1145/2492517.2492533
10.1007/978-3-031-30448-4_9
10.1006/jagm.1996.0046
10.1007/BF01386390
10.4086/toc.2007.v003a006
10.1002/widm.1372
10.1109/TPDS.2019.2960226
10.1145/2487788.2488058
10.1109/TPDS.2017.2763951
10.1016/j.dam.2010.10.012
10.1109/ICDE.2017.53
10.14778/3151113.3151122
10.1007/s41019-023-00227-6
10.1007/s00453-016-0204-1
10.1007/s00453-018-0473-y
10.1016/j.procs.2017.05.098
10.1109/90.974525
10.14778/3157794.3157802
10.14778/2733085.2733097
10.1145/2187836.2187884
10.7155/jgaa.00620
10.1145/367766.368168
10.1103/PhysRevE.70.066111
10.1145/3299901
10.1145/2523616.2525943
10.1137/1.9781611975031.4
10.1109/ICDE60146.2024.00197
10.1109/TPDS.2018.2835441
10.1145/1739041.1739098
10.1109/TKDE.2018.2828086
10.1109/ASONAM.2010.17
10.1145/2933267.2933299
10.1007/s11704-016-5485-7
10.1137/0201010
10.14778/3598581.3598592
10.1109/HPEC.2012.6408680
10.1007/s00778-016-0423-8
10.1007/s41109-025-00702-1
10.1145/2588555.2610495
10.1145/3483595
10.1016/j.ins.2015.07.053
10.14778/2850578.2850580
10.7494/csci.2012.13.3.113
10.1016/j.comnet.2013.05.001
10.1137/0202019
10.1109/CBD.2017.38
10.14778/3446095.3446099
10.1016/j.ins.2020.02.028
10.1145/1651274.1651278
ContentType Journal Article
Copyright COPYRIGHT 2025 MDPI AG
2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: COPYRIGHT 2025 MDPI AG
– notice: 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
DOA
DOI 10.3390/app15116003
DatabaseName CrossRef
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest One
ProQuest Central Korea
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Publicly Available Content Database

CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 2076-3417
ExternalDocumentID oai_doaj_org_article_e8ed5d5564b049ffaa676eeafd9a870c
A845090680
10_3390_app15116003
GeographicLocations United States
GeographicLocations_xml – name: United States
GroupedDBID .4S
2XV
5VS
7XC
8CJ
8FE
8FG
8FH
AADQD
AAFWJ
AAYXX
ADBBV
ADMLS
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
APEBS
ARCSS
BCNDV
BENPR
CCPQU
CITATION
CZ9
D1I
D1J
D1K
GROUPED_DOAJ
IAO
IGS
ITC
K6-
K6V
KC.
KQ8
L6V
LK5
LK8
M7R
MODMG
M~E
OK1
P62
PHGZM
PHGZT
PIMPY
PROAC
TUS
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
PUEGO
ID FETCH-LOGICAL-c405t-22fcec8ed42fe3bd76c2f93d5a26779f8143596f07cf92bcff01a2eabb8595a3
IEDL.DBID DOA
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001505777900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2076-3417
IngestDate Tue Oct 14 19:08:52 EDT 2025
Sat Aug 23 14:15:11 EDT 2025
Tue Nov 04 18:17:40 EST 2025
Sat Nov 29 07:09:34 EST 2025
Tue Nov 18 22:17:47 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 11
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c405t-22fcec8ed42fe3bd76c2f93d5a26779f8143596f07cf92bcff01a2eabb8595a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-6572-2600
0000-0003-1772-6863
0000-0001-5608-4555
0000-0001-8111-0401
OpenAccessLink https://doaj.org/article/e8ed5d5564b049ffaa676eeafd9a870c
PQID 3217722677
PQPubID 2032433
ParticipantIDs doaj_primary_oai_doaj_org_article_e8ed5d5564b049ffaa676eeafd9a870c
proquest_journals_3217722677
gale_infotracacademiconefile_A845090680
crossref_citationtrail_10_3390_app15116003
crossref_primary_10_3390_app15116003
PublicationCentury 2000
PublicationDate 2025-06-01
PublicationDateYYYYMMDD 2025-06-01
PublicationDate_xml – month: 06
  year: 2025
  text: 2025-06-01
  day: 01
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Applied sciences
PublicationYear 2025
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References ref_94
ref_137
ref_93
Meyerhenke (ref_5) 2016; Volume 9220
ref_92
ref_139
ref_91
ref_138
ref_14
ref_12
ref_131
ref_11
ref_99
ref_130
ref_10
Li (ref_74) 2014; 26
ref_98
Gedik (ref_70) 2016; 25
ref_97
Preuveneers (ref_51) 2004; 6
ref_134
Qin (ref_109) 2017; 20
ref_18
ref_17
ref_16
Cohen (ref_145) 2008; 16
ref_15
Luo (ref_77) 2020; 7
ref_126
ref_125
Aksu (ref_68) 2014; 26
ref_24
Ju (ref_121) 2016; 10
ref_22
ref_21
Stix (ref_62) 2004; 27
ref_122
ref_123
Ramalingam (ref_128) 1996; 158
ref_27
Yu (ref_64) 2024; 36
ref_26
Hanauer (ref_127) 2022; 27
Chen (ref_162) 2023; 8
Barenboim (ref_55) 2017; 108
ref_159
ref_71
Shen (ref_1) 2024; 17
Hua (ref_69) 2020; 31
Hopcroft (ref_152) 1973; 16
Kherad (ref_149) 2024; 80
Sepielak (ref_32) 2015; 295
Alishahi (ref_140) 2011; 159
Mai (ref_120) 2019; 31
Reif (ref_157) 1987; 25
ref_76
ref_155
ref_154
ref_73
Simard (ref_42) 2023; 27
Zuckerman (ref_141) 2007; 3
Cela (ref_29) 2014; 6
ref_160
Barba (ref_52) 2019; 81
Yuan (ref_53) 2017; 11
ref_83
ref_82
Tian (ref_79) 2023; 16
ref_81
ref_80
Tarjan (ref_153) 1974; 3
Aioanei (ref_108) 2012; 13
ref_89
ref_142
ref_88
ref_87
Chan (ref_107) 2009; 58
ref_144
ref_86
ref_143
ref_85
ref_146
ref_84
Dijkstra (ref_135) 1959; 1
Baswana (ref_96) 2017; 79
Jin (ref_72) 2018; 29
Maillard (ref_148) 2013; 18
Li (ref_170) 2023; 34
Brandes (ref_133) 2001; 25
Yu (ref_20) 2022; 9
Clauset (ref_147) 2004; 70
Tarjan (ref_150) 1972; 1
ref_50
Hopcroft (ref_151) 1973; 2
Fan (ref_115) 2020; 13
Lin (ref_19) 2021; 14
Franciosa (ref_95) 1997; 61
ref_58
ref_57
ref_172
ref_56
Ansari (ref_33) 2024; 12
ref_54
Reif (ref_156) 1985; 20
Yu (ref_101) 2024; 36
Sha (ref_124) 2017; 11
ref_59
Floyd (ref_136) 1962; 5
Das (ref_66) 2018; 4
ref_61
ref_60
ref_169
Liang (ref_165) 2020; 520
Miltersen (ref_158) 1994; 130
ref_161
ref_67
ref_163
ref_65
ref_166
ref_168
Zhang (ref_118) 2022; 15
ref_167
Wehmuth (ref_23) 2013; 57
Solomon (ref_49) 2020; 16
ref_171
Greco (ref_104) 2018; 30
ref_114
ref_116
Ramalingam (ref_132) 1996; 21
Hayashi (ref_38) 2015; 9
Yang (ref_90) 2019; 13
Huang (ref_112) 2016; 9
ref_35
He (ref_13) 2020; 10
ref_34
Das (ref_63) 2019; 28
ref_111
ref_31
ref_110
Jamour (ref_39) 2018; 29
ref_113
Teitelbaum (ref_129) 1981; 24
ref_37
Bai (ref_75) 2023; 35
Luo (ref_78) 2023; 72
Lyu (ref_36) 2022; 31
Siu (ref_164) 2001; 9
ref_103
ref_106
ref_105
Liu (ref_28) 2020; 29
Lee (ref_25) 2016; 326
ref_47
ref_46
ref_45
Vilella (ref_30) 2025; 10
ref_44
Xu (ref_117) 2014; 7
ref_43
ref_100
ref_41
ref_102
ref_40
ref_3
Kumar (ref_119) 2022; 13
ref_2
ref_9
ref_8
Li (ref_48) 2019; 28
ref_4
ref_7
ref_6
References_xml – ident: ref_142
  doi: 10.1007/978-3-319-25730-3
– volume: 158
  start-page: 233
  year: 1996
  ident: ref_128
  article-title: On the Computational Complexity of Dynamic Graph Problems
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(95)00079-8
– ident: ref_155
  doi: 10.1145/564913.564917
– volume: 13
  start-page: 1261
  year: 2020
  ident: ref_115
  article-title: Incrementalization of Graph Partitioning Algorithms
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3389133.3389142
– volume: 12
  start-page: 154482
  year: 2024
  ident: ref_33
  article-title: Multi-Cluster Graph (MCG): A Novel Clustering-Based Multi-Relation Graph Neural Networks for Stock Price Forecasting
  publication-title: IEEE Access
  doi: 10.1109/ACCESS.2024.3476159
– ident: ref_87
  doi: 10.3390/a10030102
– volume: 36
  start-page: 1650
  year: 2024
  ident: ref_64
  article-title: Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2023.3311398
– ident: ref_167
  doi: 10.14778/3358701.3358706
– volume: 34
  start-page: 539
  year: 2023
  ident: ref_170
  article-title: Research on dynamic graph partitioning algorithms: A Survey
  publication-title: J. Softw.
– ident: ref_83
  doi: 10.1109/IPDPSW63119.2024.00063
– volume: 26
  start-page: 2439
  year: 2014
  ident: ref_68
  article-title: Distributed $k$ -Core View Materializationand Maintenance for Large Dynamic Graphs
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2013.2297918
– volume: 295
  start-page: 18
  year: 2015
  ident: ref_32
  article-title: The application of social network analysis algorithms in a system supporting money laundering detection
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2014.10.015
– ident: ref_123
– ident: ref_71
– ident: ref_94
  doi: 10.1137/1.9781611974331.ch52
– ident: ref_8
  doi: 10.1109/CSNT.2011.137
– ident: ref_46
  doi: 10.1109/ICDM.2013.135
– ident: ref_80
  doi: 10.24963/ijcai.2019/313
– ident: ref_161
  doi: 10.1145/2623330.2623674
– volume: 25
  start-page: 65
  year: 1987
  ident: ref_157
  article-title: A Topological Approach to Dynamic Graph Connectivity
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(87)90095-0
– ident: ref_56
  doi: 10.1007/978-3-031-30675-4_10
– ident: ref_114
– ident: ref_172
  doi: 10.1145/2588555.2612182
– volume: 7
  start-page: 1435
  year: 2020
  ident: ref_77
  article-title: Batch Processing for Truss Maintenance in Large Dynamic Graphs
  publication-title: IEEE Trans. Comput. Soc. Syst.
  doi: 10.1109/TCSS.2020.3026574
– ident: ref_27
– ident: ref_125
  doi: 10.1145/3669906
– ident: ref_134
  doi: 10.1145/2660460.2660465
– volume: 6
  start-page: 66
  year: 2014
  ident: ref_29
  article-title: Energy optimal real-time navigation system
  publication-title: IEEE Intell. Transp. Syst. Mag.
  doi: 10.1109/MITS.2014.2324000
– ident: ref_10
  doi: 10.1007/978-3-642-31464-3_29
– ident: ref_85
  doi: 10.1007/978-3-319-32149-3_20
– volume: 20
  start-page: 915
  year: 2017
  ident: ref_109
  article-title: Efficient computation of distance labeling for decremental updates in large dynamic graphs
  publication-title: World Wide Web
  doi: 10.1007/s11280-016-0421-1
– ident: ref_163
  doi: 10.1007/978-3-031-30675-4_18
– ident: ref_171
  doi: 10.1145/2213836.2213854
– volume: 61
  start-page: 113
  year: 1997
  ident: ref_95
  article-title: The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs
  publication-title: Inf. Process. Lett.
  doi: 10.1016/S0020-0190(96)00202-5
– volume: 13
  start-page: 142
  year: 2019
  ident: ref_90
  article-title: Fully Dynamic Depth-First Search in Directed Graphs
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3364324.3364329
– volume: 9
  start-page: 540
  year: 2016
  ident: ref_112
  article-title: LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2904483.2904486
– ident: ref_7
  doi: 10.1145/3366423.3380119
– ident: ref_110
  doi: 10.1145/2588555.2612181
– ident: ref_131
  doi: 10.1145/2508020.2489791
– ident: ref_22
  doi: 10.1145/1321440.1321520
– volume: 9
  start-page: 710
  year: 2022
  ident: ref_20
  article-title: Fast Core Maintenance in Dynamic Graphs
  publication-title: IEEE Trans. Comput. Soc. Syst.
  doi: 10.1109/TCSS.2021.3064836
– ident: ref_130
  doi: 10.1145/3035918.3035944
– ident: ref_98
  doi: 10.1007/978-3-662-48054-0_9
– ident: ref_86
– volume: 15
  start-page: 2908
  year: 2022
  ident: ref_118
  article-title: Effective Indexing for Dynamic Structural Graph Clustering
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3551793.3551840
– volume: 130
  start-page: 203
  year: 1994
  ident: ref_158
  article-title: Complexity Models for Incremental Computation
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/0304-3975(94)90159-7
– ident: ref_50
  doi: 10.1109/SC.2016.29
– ident: ref_113
  doi: 10.1007/978-3-030-59416-9_29
– ident: ref_76
  doi: 10.1145/3605573.3605597
– volume: 20
  start-page: 229
  year: 1985
  ident: ref_156
  article-title: Depth-First Search is Inherently Sequential
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(85)90024-9
– ident: ref_14
– volume: 72
  start-page: 707
  year: 2023
  ident: ref_78
  article-title: Exploring Truss Maintenance in Fully Dynamic Graphs: A Mixed Structure-Based Approach
  publication-title: IEEE Trans. Comput.
– ident: ref_106
– ident: ref_103
  doi: 10.1145/3357713.3384236
– ident: ref_16
  doi: 10.1145/3380936
– volume: 13
  start-page: 199
  year: 2022
  ident: ref_119
  article-title: DPISCAN: Distributed and parallel architecture with indexing for structural clustering of massive dynamic graphs
  publication-title: Int. J. Data Sci. Anal.
  doi: 10.1007/s41060-021-00303-y
– ident: ref_6
– volume: 31
  start-page: 1365
  year: 2022
  ident: ref_36
  article-title: Maximum and top-k diversified biclique search at scale
  publication-title: VLDB J.
  doi: 10.1007/s00778-021-00681-6
– volume: 28
  start-page: 765
  year: 2019
  ident: ref_48
  article-title: Eccentricities on small-world networks
  publication-title: VLDB J.
  doi: 10.1007/s00778-019-00566-9
– ident: ref_81
– ident: ref_26
  doi: 10.1109/HPEC.2018.8547518
– volume: 18
  start-page: 1
  year: 2013
  ident: ref_148
  article-title: Dynamic graph clustering combining modularity and smoothness
  publication-title: J. Exp. Algorithmics
– volume: 30
  start-page: 474
  year: 2018
  ident: ref_104
  article-title: Efficient Maintenance of Shortest Distances in Dynamic Graphs
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2017.2772233
– volume: 16
  start-page: 372
  year: 1973
  ident: ref_152
  article-title: Efficient Algorithms for Graph Manipulation [H] (Algorithm 447)
  publication-title: Commun. ACM
  doi: 10.1145/362248.362272
– ident: ref_137
– ident: ref_67
  doi: 10.1007/978-3-030-32591-6_35
– volume: 26
  start-page: 2453
  year: 2014
  ident: ref_74
  article-title: Efficient Core Maintenance in Large Dynamic Graphs
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2013.158
– volume: 28
  start-page: 351
  year: 2019
  ident: ref_63
  article-title: Incremental maintenance of maximal cliques in a dynamic graph
  publication-title: VLDB J.
  doi: 10.1007/s00778-019-00540-5
– ident: ref_43
  doi: 10.1007/978-3-319-03536-9_14
– ident: ref_89
– ident: ref_92
  doi: 10.3390/a12030052
– ident: ref_154
– ident: ref_59
  doi: 10.1137/1.9781611977912.122
– ident: ref_160
  doi: 10.1109/ICDE.2017.136
– ident: ref_54
  doi: 10.1137/1.9781611975031.1
– volume: 4
  start-page: 231
  year: 2018
  ident: ref_66
  article-title: Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph
  publication-title: IEEE Trans. Multi Scale Comput. Syst.
  doi: 10.1109/TMSCS.2018.2802920
– volume: 58
  start-page: 541
  year: 2009
  ident: ref_107
  article-title: Shortest Path Tree Computation in Dynamic Graphs
  publication-title: IEEE Trans. Comput.
  doi: 10.1109/TC.2008.198
– ident: ref_168
  doi: 10.1109/PDP.2016.109
– ident: ref_126
  doi: 10.1007/s11704-023-2656-1
– volume: 80
  start-page: 24664
  year: 2024
  ident: ref_149
  article-title: Community detection based on influential nodes in dynamic networks
  publication-title: J. Supercomput.
  doi: 10.1007/s11227-024-06367-4
– ident: ref_57
  doi: 10.1137/1.9781611975482.117
– ident: ref_4
  doi: 10.1007/978-1-0716-3327-4
– ident: ref_47
  doi: 10.1007/978-3-030-59416-9_32
– ident: ref_58
  doi: 10.1145/3564246.3585105
– volume: 25
  start-page: 163
  year: 2001
  ident: ref_133
  article-title: A faster algorithm for betweenness centrality
  publication-title: J. Math. Sociol.
  doi: 10.1080/0022250X.2001.9990249
– ident: ref_84
– ident: ref_116
  doi: 10.1145/2556195.2556213
– volume: 27
  start-page: 173
  year: 2004
  ident: ref_62
  article-title: Finding all maximal cliques in dynamic graphs
  publication-title: Comput. Optim. Appl.
  doi: 10.1023/B:COAP.0000008651.28952.b6
– volume: 35
  start-page: 8919
  year: 2023
  ident: ref_75
  article-title: Parallel Core Maintenance of Dynamic Graphs
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2022.3219096
– ident: ref_9
  doi: 10.1137/1.9781611974782.166
– ident: ref_169
  doi: 10.1145/2806416.2806424
– ident: ref_159
  doi: 10.1145/3097983.3097995
– volume: 24
  start-page: 563
  year: 1981
  ident: ref_129
  article-title: The Cornell program synthesizer: A syntax-directed programming environment
  publication-title: Commun. ACM
  doi: 10.1145/358746.358755
– ident: ref_44
  doi: 10.1145/2492517.2500270
– ident: ref_61
– volume: 29
  start-page: 1075
  year: 2020
  ident: ref_28
  article-title: Efficient (α, β)-core computation in bipartite graphs
  publication-title: VLDB J.
  doi: 10.1007/s00778-020-00606-9
– ident: ref_35
– ident: ref_45
  doi: 10.1109/CLUSTER.2013.6702680
– volume: 3
  start-page: 62
  year: 1974
  ident: ref_153
  article-title: Finding Dominators in Directed Graphs
  publication-title: SIAM J. Comput.
  doi: 10.1137/0203006
– ident: ref_166
  doi: 10.1145/3589132.3625647
– volume: Volume 9220
  start-page: 117
  year: 2016
  ident: ref_5
  article-title: Recent Advances in Graph Partitioning
  publication-title: Algorithm Engineering—Selected Results and Surveys
  doi: 10.1007/978-3-319-49487-6_4
– volume: 36
  start-page: 2759
  year: 2024
  ident: ref_101
  article-title: A Distributed Solution for Efficient K Shortest Paths Computation Over Dynamic Road Networks
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2023.3346377
– volume: 6
  start-page: 381
  year: 2004
  ident: ref_51
  article-title: ACODYGRA: An agent algorithm for coloring dynamic graphs
  publication-title: Symb. Numer. Algorithms Sci. Comput.
– volume: 17
  start-page: 159
  year: 2024
  ident: ref_1
  article-title: SNGPLDP: Social network graph generation based on personalised local differential privacy
  publication-title: Int. J. Auton. Adapt. Commun. Syst.
  doi: 10.1504/IJAACS.2024.137062
– ident: ref_105
  doi: 10.1145/2463676.2465315
– ident: ref_139
– ident: ref_40
  doi: 10.1145/2492517.2492533
– ident: ref_143
  doi: 10.1007/978-3-031-30448-4_9
– volume: 21
  start-page: 267
  year: 1996
  ident: ref_132
  article-title: An Incremental Algorithm for a Generalization of the Shortest-Path Problem
  publication-title: J. Algorithms
  doi: 10.1006/jagm.1996.0046
– volume: 1
  start-page: 269
  year: 1959
  ident: ref_135
  article-title: A note on two problems in connexion with graphs
  publication-title: Numer. Math.
  doi: 10.1007/BF01386390
– volume: 3
  start-page: 103
  year: 2007
  ident: ref_141
  article-title: Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number
  publication-title: Theory Comput.
  doi: 10.4086/toc.2007.v003a006
– volume: 10
  start-page: e1372
  year: 2020
  ident: ref_13
  article-title: A survey of pattern mining in dynamic graphs
  publication-title: Wiley Interdiscip. Rev. Data Min. Knowl. Discov.
  doi: 10.1002/widm.1372
– volume: 31
  start-page: 1287
  year: 2020
  ident: ref_69
  article-title: Faster Parallel Core Maintenance Algorithms in Dynamic Graphs
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/TPDS.2019.2960226
– ident: ref_41
– ident: ref_3
  doi: 10.1145/2487788.2488058
– volume: 29
  start-page: 659
  year: 2018
  ident: ref_39
  article-title: Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/TPDS.2017.2763951
– volume: 159
  start-page: 152
  year: 2011
  ident: ref_140
  article-title: On the dynamic coloring of graphs
  publication-title: Discret. Appl. Math.
  doi: 10.1016/j.dam.2010.10.012
– ident: ref_65
  doi: 10.1109/ICDE.2017.53
– volume: 11
  start-page: 107
  year: 2017
  ident: ref_124
  article-title: Accelerating Dynamic Graph Analytics on GPUs
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3151113.3151122
– volume: 8
  start-page: 263
  year: 2023
  ident: ref_162
  article-title: Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks
  publication-title: Data Sci. Eng.
  doi: 10.1007/s41019-023-00227-6
– volume: 79
  start-page: 466
  year: 2017
  ident: ref_96
  article-title: Incremental algorithm for maintaining a DFS tree for undirected graphs
  publication-title: Algorithmica
  doi: 10.1007/s00453-016-0204-1
– ident: ref_93
– volume: 81
  start-page: 1319
  year: 2019
  ident: ref_52
  article-title: Dynamic Graph Coloring
  publication-title: Algorithmica
  doi: 10.1007/s00453-018-0473-y
– volume: 108
  start-page: 89
  year: 2017
  ident: ref_55
  article-title: Fully-dynamic graph algorithms with sublinear time inspired by distributed computing
  publication-title: Procedia Comput. Sci.
  doi: 10.1016/j.procs.2017.05.098
– volume: 9
  start-page: 706
  year: 2001
  ident: ref_164
  article-title: New dynamic SPT algorithm based on a ball-and-string model
  publication-title: IEEE/ACM Trans. Netw.
  doi: 10.1109/90.974525
– ident: ref_24
– ident: ref_34
– volume: 11
  start-page: 338
  year: 2017
  ident: ref_53
  article-title: Effective and Efficient Dynamic Graph Coloring
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3157794.3157802
– volume: 16
  start-page: 41
  year: 2020
  ident: ref_49
  article-title: Improved dynamic graph coloring
  publication-title: ACM Trans. Algorithms (TALG)
– ident: ref_138
– volume: 7
  start-page: 1917
  year: 2014
  ident: ref_117
  article-title: LogGP: A Log-based Dynamic Graph Partitioning Method
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2733085.2733097
– ident: ref_17
  doi: 10.1145/2187836.2187884
– volume: 27
  start-page: 195
  year: 2023
  ident: ref_42
  article-title: Computing Betweenness Centrality in Link Streams
  publication-title: J. Graph Algorithms Appl.
  doi: 10.7155/jgaa.00620
– volume: 5
  start-page: 345
  year: 1962
  ident: ref_136
  article-title: Algorithm 97: Shortest path
  publication-title: Commun. ACM
  doi: 10.1145/367766.368168
– ident: ref_37
– ident: ref_102
– volume: 70
  start-page: 066111
  year: 2004
  ident: ref_147
  article-title: Finding community structure in very large networks
  publication-title: Phys. Rev. E-Stat. Nonlinear Soft Matter Phys.
  doi: 10.1103/PhysRevE.70.066111
– volume: 27
  start-page: 1
  year: 2022
  ident: ref_127
  article-title: Recent advances in fully dynamic graph algorithms—A quick reference guide
  publication-title: ACM J. Exp. Algorithmics
– ident: ref_18
– ident: ref_100
  doi: 10.1145/3299901
– ident: ref_21
– ident: ref_111
  doi: 10.1145/2523616.2525943
– ident: ref_97
  doi: 10.1137/1.9781611975031.4
– ident: ref_144
  doi: 10.1109/ICDE60146.2024.00197
– volume: 29
  start-page: 2416
  year: 2018
  ident: ref_72
  article-title: Core Maintenance in Dynamic Graphs: A Parallel Approach Based on Matching
  publication-title: IEEE Trans. Parallel Distrib. Syst.
  doi: 10.1109/TPDS.2018.2835441
– ident: ref_15
  doi: 10.1145/1739041.1739098
– volume: 31
  start-page: 1239
  year: 2019
  ident: ref_120
  article-title: Scalable Interactive Dynamic Graph Clustering on Multicore CPUs
  publication-title: IEEE Trans. Knowl. Data Eng.
  doi: 10.1109/TKDE.2018.2828086
– ident: ref_146
  doi: 10.1109/ASONAM.2010.17
– ident: ref_73
  doi: 10.1145/2933267.2933299
– ident: ref_2
– volume: 10
  start-page: 462
  year: 2016
  ident: ref_121
  article-title: iGraph: An incremental data processing system for dynamic graph
  publication-title: Front. Comput. Sci.
  doi: 10.1007/s11704-016-5485-7
– volume: 1
  start-page: 146
  year: 1972
  ident: ref_150
  article-title: Depth-First Search and Linear Graph Algorithms
  publication-title: SIAM J. Comput.
  doi: 10.1137/0201010
– ident: ref_12
– volume: 16
  start-page: 2199
  year: 2023
  ident: ref_79
  article-title: Maximal D-truss Search in Dynamic Directed Graphs
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3598581.3598592
– ident: ref_122
  doi: 10.1109/HPEC.2012.6408680
– volume: 25
  start-page: 425
  year: 2016
  ident: ref_70
  article-title: Incremental k-core decomposition: Algorithms and evaluation
  publication-title: VLDB J.
  doi: 10.1007/s00778-016-0423-8
– volume: 10
  start-page: 14
  year: 2025
  ident: ref_30
  article-title: Weirdnodes: Centrality based anomaly detection on temporal networks for the anti-financial crime domain
  publication-title: Appl. Netw. Sci.
  doi: 10.1007/s41109-025-00702-1
– ident: ref_82
  doi: 10.1145/2588555.2610495
– ident: ref_11
  doi: 10.1145/3483595
– volume: 16
  start-page: 1
  year: 2008
  ident: ref_145
  article-title: Trusses: Cohesive subgraphs for social network analysis
  publication-title: Natl. Secur. Agency Tech. Rep.
– volume: 326
  start-page: 278
  year: 2016
  ident: ref_25
  article-title: Efficient algorithms for updating betweenness centrality in fully dynamic graphs
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2015.07.053
– volume: 9
  start-page: 48
  year: 2015
  ident: ref_38
  article-title: Fully Dynamic Betweenness Centrality Maintenance on Massive Networks
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/2850578.2850580
– ident: ref_91
– volume: 13
  start-page: 113
  year: 2012
  ident: ref_108
  article-title: Lazy Shortest Path Computation in Dynamic graphs
  publication-title: Comput. Sci.
  doi: 10.7494/csci.2012.13.3.113
– ident: ref_60
– volume: 57
  start-page: 2536
  year: 2013
  ident: ref_23
  article-title: Daccer: Distributed assessment of the closeness centrality ranking in complex networks
  publication-title: Comput. Netw.
  doi: 10.1016/j.comnet.2013.05.001
– volume: 2
  start-page: 225
  year: 1973
  ident: ref_151
  article-title: An n^5/2 algorithm for maximum matchings in bipartite graphs
  publication-title: SIAM J. Comput.
  doi: 10.1137/0202019
– ident: ref_31
  doi: 10.1109/CBD.2017.38
– volume: 14
  start-page: 757
  year: 2021
  ident: ref_19
  article-title: Hierarchical Core Maintenance on Large Dynamic Graphs
  publication-title: Proc. VLDB Endow.
  doi: 10.14778/3446095.3446099
– volume: 520
  start-page: 232
  year: 2020
  ident: ref_165
  article-title: Reachability preserving compression for dynamic graph
  publication-title: Inf. Sci.
  doi: 10.1016/j.ins.2020.02.028
– ident: ref_88
  doi: 10.1145/1651274.1651278
– ident: ref_99
SSID ssj0000913810
Score 2.3274188
SecondaryResourceType review_article
Snippet Graph as one of the most fundamental and representative data structures has found a wide spectrum of emerging application domains such as social media,...
SourceID doaj
proquest
gale
crossref
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
StartPage 6003
SubjectTerms Advertising
Algorithms
dynamic graph algorithms
Efficiency
fully graph update
graph analysis
Graph coloring
Graph representations
Proteins
Social media
Social network analysis
Social networks
Surveys
system
SummonAdditionalLinks – databaseName: ProQuest Central
  dbid: BENPR
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED7xGmDgUUAECsqAxEOKaOy8PKECBQZUVagDm-U4NqqE2tIUfj93iVtAAhZWx4nOOd_Tvu8AjinUUWFLBaFNMEBRJgoUs0Wgk0wzpjQXpkLXf0i73ezpSfRcwq101ypnOrFS1MVIU478gqPvnKKvkKaX49eAukbR6aprobEIy4RUhvt8-arT7T3OsyyEepmFrbowj2N8T-fCaORCtPP8mymqEPt_08uVsbnd-C-Zm7Du3Ey_Xe-LLVgwwwasfQEfbMCWE-vSP3XY02fbEKMbiWbIb9dXA0p_MPQ7FcoEjd7U7ev9O0K59l2NAX5sB_q3nf71feA6KwQaHbRpwJjVRmemiJg1PC_SRDMreBErolzYjLwokdhWqq1guba2FSpmVJ4THJriu7A0HA3NHvg21hZfwcDDmohpluWoEGIeKVtwkYvCg_PZP5baoY5T84sXidEHMUR-YYgHx_PJ4xps4-dpV8Ss-RRCyK4GRpNn6QROGlxdXMRxEuUYBFmrVJImxiBdQqGO0h6cEKslyTESpJUrR8BlESKWbGcR-lLUmcSD5ozV0gl4KT_5vP_34wNYZdQyuErcNGFpOnkzh7Ci36eDcnLk9usHmAL0hg
  priority: 102
  providerName: ProQuest
Title Recent Advances in Efficient Dynamic Graph Processing
URI https://www.proquest.com/docview/3217722677
https://doaj.org/article/e8ed5d5564b049ffaa676eeafd9a870c
Volume 15
WOSCitedRecordID wos001505777900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: DOA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: M~E
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: BENPR
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: PIMPY
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3PS8MwFH7I9KAH0alYnaOHgT-guCb9leOmmwo6huwwTyFNExjIlG369_tem40JihePDWlJv5eX976m-R5Ai6iOCtsqCG2CBEWZKFDMFoFOMs2Y0lyYUl3_MR0MsvFYDNdKfdE_YZU8cAXctclMERdxnEQ5JrPWKpWkiTHKFkLhXNO0-rZTsUamyjVYhCRdVR3I48jraT8Yg1uI8Z1_C0GlUv9v63EZZPp7sOuyQ79TjWofNsy0DjtrmoF12HfeOPcvnGT05QHEmP1h9PA71Y7-3J9M_V4pDkGtt1XVef-OxKl9dzQAH3YIo35vdHMfuIIIgca8ahEwZrXRCEjErOF5kSaaWcGLWLEkTYXNKPkRiW2n2gqWa2vboWJG5TmpmCl-BLXp29Qcg29jbfEW5AvWREyzLEc_jnmEsHKRi8KDqyVEUjuxcKpZ8SqRNBCecg1PD1qrzu-VRsbP3bqE9aoLCVuXDWhu6cwt_zK3B-dkKUnuhwPSyp0iwNciISvZySJMgaigiAeNpTGl88u55MjAUkZonfzHaE5hm1E94PKrTANqi9mHOYMt_bmYzGdN2Oz2BsPnZjk18Wr48DR8-QIszeop
linkProvider Directory of Open Access Journals
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VLRLlALRQsbSAD0U8pKiJnZcPCC20patuV3vYQzlZjmNXK0G2bBZQfxT_sTOJsxQJuPXA1XEsOzOZ-cb2fAOwR6GOjkIdRC7FAEXbONDclYFJc8O5NkLahl1_lI3H-dmZnKzBzy4Xhq5VdjaxMdTl3NAe-b5A7JwhVsiydxdfA6oaRaerXQmNVi1O7OUPDNnqt8MDlO8Lzo8Opx-OA19VIDAITpYB585Yk9sy5s6KosxSw50UZaJpcOlyQhAydWFmnOSFcS6MNLe6KIgKTAsc9hasx6TrPVifDE8nn1abOkSymUdhmwcohAzpGBp9aoSwQvzm-ZoCAX9zA41vO7r_n32VB3DPg2g2aLV-E9ZstQV3r1ErbsGmN1o1e-WZtV8_hARBMjpZNmgvPtRsVrHDhkODWg8uK_1lZthH4vBmPoMCB3sE05tYyzb0qnllHwNziXH4CoZVzsbc8LxAc5eIWLtSyEKWfXjTiVQZz6lOpT0-K4ytSP7qmvz7sLfqfNFSify523vSjVUX4v9uGuaLc-XNibK4uqRMkjQuMMRzTus0S63FeUmNFtj04SVpliIrhRMy2idb4LKI70sN8hiRItVd6cNup1nKm69a_VKrJ_9-_BzuHE9PR2o0HJ_swAan4sjNFtUu9JaLb_Yp3Dbfl7N68cz_KgzUDavhFfnrUzI
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB2VLUJwKLSAWFrAhyKgUtTEzpcPFVrYLqxaVnvooZwsx7HRSm22bBZQfxr_rjOJsxQJuPXANXGcOH6eeeOPNwC7FOroKNRB5FIMULSNA81dGZg0N5xrI6Rt1PWPs8kkPz2V0zX42Z2FoW2VnU1sDHU5NzRHvi-QO2fIFbJs3_ltEdPh6O3F14AySNFKa5dOo4XIkb38geFbfTAeYl-_5Hx0ePL-Y-AzDAQGicoy4NwZa3JbxtxZUZRZariTokw0vUi6nNiETF2YGSd5YZwLI82tLgqSBdMCq70F68jIY96D9en40_TzaoKHBDfzKGzPBAohQ1qSRv8aIcUQv3nBJlnA31xC4-dG9__jP_QANjy5ZoN2NGzCmq224N41ycUt2PTGrGavveL2m4eQIHlG58sG7YaIms0qdthoa9DV4WWlz2eGfSBtb-ZPVmBlj-DkJtryGHrVvLJPgLnEOHwEwy1nY254XqAZTESsXSlkIcs-7HXdq4zXWqeUH2cKYy7CgrqGhT7srgpftBIjfy72jnCyKkK64M2F-eKL8mZGWWxdUiZJGhcY-jmndZql1uJ3SY2W2fThFaFMkfXCDzLaH8LAZpEOmBrkMTJIysfSh50OZcqbtVr9gtjTf99-AXcQe-p4PDnahrucciY3M1c70FsuvtlncNt8X87qxXM_ahioG0bhFdpVW_I
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Recent+Advances+in+Efficient+Dynamic+Graph+Processing&rft.jtitle=Applied+sciences&rft.au=Zi+Chen&rft.au=Keke+Liang&rft.au=Long+Yuan&rft.au=Wenjie+Zhang&rft.date=2025-06-01&rft.pub=MDPI+AG&rft.eissn=2076-3417&rft.volume=15&rft.issue=11&rft.spage=6003&rft_id=info:doi/10.3390%2Fapp15116003&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_e8ed5d5564b049ffaa676eeafd9a870c
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon