2016
DOI: 10.14569/ijacsa.2016.070273
|View full text |Cite
|
Sign up to set email alerts
|

Comprehensive Survey on Dynamic Graph Models

Abstract: Abstract-Most of the critical real-world networks are continuously changing and evolving with time. Motivated by the growing importance and widespread impact of this type of networks, the dynamic nature of these networks have gained a lot of attention. Because of their intrinsic and special characteristics, these networks are best represented by dynamic graph models. To cope with their evolving nature, the representation model must keep the historical information of the network along with its temporal time. St… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
27
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 29 publications
(27 citation statements)
references
References 23 publications
0
27
0
Order By: Relevance
“…In order to make a tradeoff between the performance of historical state recreation and the storage reduction, some researchers try to combine the first two models [31]. It is called as 'snapshot plus log'.…”
Section: Related Workmentioning
confidence: 99%
“…In order to make a tradeoff between the performance of historical state recreation and the storage reduction, some researchers try to combine the first two models [31]. It is called as 'snapshot plus log'.…”
Section: Related Workmentioning
confidence: 99%
“…Given the target sets N t , the coverage radius, and the communication range of the UAVs, one can derive a dynamic representation of the topology of our problem. Due to their dynamic and evolving characteristics, these networks are best represented by dynamic graph models [37]. For ADCP, we define a set of graphs…”
Section: Dynamic Graph Modelmentioning
confidence: 99%
“…Most of the literature on graphs is concerned with static graphs, i.e., graphs that do not change over time. However, many of today's applications use dynamic graphs (that change over time) as their underlying data structure [15]. This has led to a surge in interest in developing new efficient algorithms that can scale to the large size and high frequency of changes in the graphs used in many modern applications, e.g., routing systems in communication networks, social networks.…”
Section: Introductionmentioning
confidence: 99%