2015 Computer Science and Information Technologies (CSIT) 2015
DOI: 10.1109/csitechnol.2015.7358272
|View full text |Cite
|
Sign up to set email alerts
|

Clustering of random networks under topological constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 9 publications
0
1
0
Order By: Relevance
“…The process of network directed evolution with link switching is called randomization. This model discovers critical effects in random networks during the directed evolution [3][4][5][6]. In the case of node degree conservation this shows up a disintegration of the network into dense clusters with weak interconnections.…”
mentioning
confidence: 81%
“…The process of network directed evolution with link switching is called randomization. This model discovers critical effects in random networks during the directed evolution [3][4][5][6]. In the case of node degree conservation this shows up a disintegration of the network into dense clusters with weak interconnections.…”
mentioning
confidence: 81%
“…Nowadays, the introduction of knowledge assessment technologies into the educational process is an important and urgent task. The use of modern knowledge assessment systems, including adaptive testing systems [1], requires mathematical support based on the processing of statistical data resulting from user's work.…”
Section: Introductionmentioning
confidence: 99%