k Closeness Centrality Faster in Unweighted Graphs.">k Closeness Centrality Faster in Unweighted Graphs., dblp, computer science, bibliography, knowledge graph, author, editor, publication, conference, journal, book, thesis, database, collection, open data, bibtex">
[go: up one dir, main page]

"Computing Top-k Closeness Centrality Faster in Unweighted Graphs."

Elisabetta Bergamini et al. (2016)

Details and statistics

DOI: 10.1137/1.9781611974317.6

access: closed

type: Conference or Workshop Paper

metadata version: 2023-06-18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.