Detection of optimal hierarchy in a quasi-hierarchical graph by centrality criteria
The results of the research dedicated to the extraction of hierarchical sub-networks, being the best in terms of centrality criteria, from quasi-hierarchical networks are presented. Multi-objective estimation methods for detection of a node which is optimal by centrality criterion are discussed. The...
Збережено в:
Дата: | 2015 |
---|---|
Автори: | , |
Формат: | Стаття |
Мова: | Ukrainian |
Опубліковано: |
Інститут проблем реєстрації інформації НАН України
2015
|
Теми: | |
Онлайн доступ: | http://drsp.ipri.kiev.ua/article/view/100332 |
Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Назва журналу: | Data Recording, Storage & Processing |
Репозитарії
Data Recording, Storage & ProcessingРезюме: | The results of the research dedicated to the extraction of hierarchical sub-networks, being the best in terms of centrality criteria, from quasi-hierarchical networks are presented. Multi-objective estimation methods for detection of a node which is optimal by centrality criterion are discussed. The hierarchy construction algorithms are analysed. Experimental verification of received theoretical results has been performed using a group of quasi-hierarchical graphs. Tabl.: 3. Fig.: 4. Refs: 5 titles. |
---|