A Dynamic Algorithm for Updating Katz Centrality in Graphs

Many large datasets from a variety of fields of research can be represented as graphs. A common query is to identify the most important, or highly ranked, vertices in a graph. Centrality metrics are used to obtain numerical scores for each vertex in the graph. The scores can then be translated to ra...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 s. 149 - 154
Hlavní autori:	Nathan, Eisha, Bader, David A.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 31.07.2017
Edícia:	ACM Conferences
Predmet:	Applied computing Applied computing > Physical sciences and engineering Applied computing > Physical sciences and engineering > Mathematics and statistics Computing methodologies Computing methodologies > Symbolic and algebraic manipulation Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms Information systems Information systems > Information systems applications Mathematics of computing Mathematics of computing > Discrete mathematics Mathematics of computing > Discrete mathematics > Graph theory Mathematics of computing > Discrete mathematics > Graph theory > Graph algorithms Mathematics of computing > Probability and statistics Theory of computation Theory of computation > Design and analysis of algorithms
ISBN:	1450349935, 9781450349932
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!