Closeness Centrality Faster in Unweighted Graphs.
Elisabetta BergaminiMichele BorassiPierluigi CrescenziAndrea MarinoHenning MeyerhenkePublished in: ALENEX (2016)
Keyphrases
- social network analysis
- degree centrality
- undirected graph
- social networks
- edge weights
- graph theoretic
- highly efficient
- structured objects
- scoring rules
- bipartite graph
- graph theory
- pruning power
- data sets
- graph databases
- graph model
- graph matching
- directed graph
- special case
- search engine
- community detection
- network analysis
- weighted graph
- spanning tree
- graph partitioning
- network structure
- graph clustering
- random graphs
- adjacency matrix
- structured data
- betweenness centrality
- bayesian networks