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...

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017 pp. 149 - 154
Main Authors:	Nathan, Eisha, Bader, David A.
Format:	Conference Proceeding
Language:	English
Published:	New York, NY, USA ACM 31.07.2017
Series:	ACM Conferences
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!