Software Tools to Quantify Structural Importance of Nodes in a
Network
c(
    person("Jacobs", "Simon", email = "sdjacobs@uchicago.edu", role = "aut"),
    person("Khanna", "Aditya", email = "khanna7@uchicago.edu", role = c("aut", "cre")),
    person("Madduri", "Kamesh", email = "madduri@cse.psu.edu", role = "ctb"),
    person("Bader", "David", email = "bader@cc.gatech.edu", role = "ctb"))
Provides functionality to compute various node centrality measures on networks.
    Included are functions to compute betweenness centrality (by utilizing Madduri and Bader's
    SNAP library), implementations of Burt's constraint and effective
    network size (ENS) metrics, Borgatti's algorithm to identify key players, and Valente's
    bridging metric. On Unix systems, the betweenness, Key Players, and
    bridging implementations are parallelized with OpenMP, which may run
    faster on systems which have OpenMP configured.
igraph (>= 1.0.1), Matrix (>= 1.1-4), methods, utils
Jacobs Simon [aut],
  Khanna Aditya [aut, cre],
  Madduri Kamesh [ctb],
  Bader David [ctb]