Back to Results
First PageMeta Content
Network theory / Networks / Network analysis / Algebraic graph theory / Centrality / Betweenness centrality / Shortest path problem / Distance / Floyd–Warshall algorithm / Graph theory / Mathematics / Theoretical computer science


A Faster Algorithm for Betweenness Centrality
Add to Reading List

Document Date: 2011-10-24 12:37:32

Open Document

File Size: 305,94 KB

Share Result on Facebook

City

Konstanz / /

Company

Aptech Systems Inc. / Ps (w) Proof / /

Country

Germany / /

/

Facility

Brown University / University of California / Betweenness Centrality∗ Ulrik Brandes University of Konstanz Department / /

IndustryTerm

large networks / Online-Publikations-System / breadth-first search / social networks / social network / traversal algorithms / shortest paths using traversal algorithms / /

Organization

CR (v) / CC (v) / Betweenness Centrality∗ Ulrik Brandes University of Konstanz Department of Computer / German Academic Exchange Service / Brown University / Department of Computer Science / University of California / Santa Barbara / /

Person

Noah Friedkin / /

Position

actor / Foreman / /

ProvinceOrState

California / /

Technology

shortest paths using traversal algorithms / directed 9 Algorithm / resulting algorithm / Floyd/Warshall algorithm / traversal algorithms / /

URL

http /

SocialTag