Method for reducing graph of communication delays in for visual analysisстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 2 января 2019 г.
Аннотация:There discussed methods for visualizing huge graphs where edges marked by distances
between vertices. The goal is to reduce graph complex
ity of huge graph in context of visual
analysis of delays. There we have used some methods of clusterization which save egde
distances. This method usability has been tested on data about delays arrived in
communications of Lomonosov supercomputer.