
Ð’ данной работе опиÑана проблема Ð½Ð°Ñ…Ð¾Ð¶Ð´ÐµÐ½Ð¸Ñ Â«Ñ‡ÐµÑ€Ð½Ñ‹Ñ… дыр» в графе. ПредÑтавлен обзор ÑущеÑтвующих алгоритмов поиÑка «черных дыр». Разработан и реализован новый алгоритм Findhole. Проведено иÑÑледование времени работы алгоритма по Ñравнению Ñ ÑƒÐ¶Ðµ ÑущеÑтвующими алгоритмами. ÐкÑпериментально подтверждена ÑÐ¸Ð»ÑŒÐ½Ð°Ñ Ð·Ð°Ð²Ð¸ÑимоÑть времени работы алгоритма от Ñтруктуры графа.
This paper describes the problem of detection "black holes" in a graph. An overview of existing algorithms for searching for "black holes" is presented. A new Findhole algorithm has been developed and implemented. The study of the running time of the algorithm is carried out in comparison with the already existing algorithms. The strong relation of the running time of the algorithm is experimentally confirmed on the structure of the graph.
"ЧеÑнÑе дÑÑÑ", ÐÑаÑов ÑеоÑиÑ, ÐлгоÑиÑмÑ
"ЧеÑнÑе дÑÑÑ", ÐÑаÑов ÑеоÑиÑ, ÐлгоÑиÑмÑ
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
