2019 2nd International Conference on Data Intelligence and Security (ICDIS) 2019
DOI: 10.1109/icdis.2019.00032
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic Social Networks Generator Based on Modularity: DSNG-M

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 31 publications
0
1
0
Order By: Relevance
“…EGG, however, disregard the topological changes to the network and narrow the temporal evolution of the graph to property updates. DSNG-M (dynamic social network generator based on modularity) [35] is a graph generator that is capable of generating temporal graphs by flipping the direction of edges of a given graph in order to satisfy a randomly chosen modularity value assigned to a single graph snapshot. Some of the aforementioned graph generators produce temporal graphs with properties on nodes or vertices, which we do not address in this paper.…”
Section: Related Workmentioning
confidence: 99%
“…EGG, however, disregard the topological changes to the network and narrow the temporal evolution of the graph to property updates. DSNG-M (dynamic social network generator based on modularity) [35] is a graph generator that is capable of generating temporal graphs by flipping the direction of edges of a given graph in order to satisfy a randomly chosen modularity value assigned to a single graph snapshot. Some of the aforementioned graph generators produce temporal graphs with properties on nodes or vertices, which we do not address in this paper.…”
Section: Related Workmentioning
confidence: 99%