Back to Results
First PageMeta Content
Network theory / Centrality / Betweenness centrality / Distance / Connectivity / Connected component / Graph / Shortest path problem / Hopcroft–Karp algorithm / Graph theory / Mathematics / Theoretical computer science


Ranking of Closeness Centrality for Large-Scale Social Networks Kazuya Okamoto1 , Wei Chen2 , and Xiang-Yang Li3 1 Kyoto University, [removed]
Add to Reading List

Document Date: 2009-07-21 19:43:34


Open Document

File Size: 158,00 KB

Share Result on Facebook

Company

Freeman L. C. / Google / Facebook / /

/

Facility

Kyoto University / Illinois Institute of Technology / /

IndustryTerm

Web-Graph / improved network optimization algorithms / faster algorithm / much more efficient algorithms / heuristic algorithm / present new algorithms / basic ranking algorithm / large-scale online-based social networks / approximation algorithm / brute-force exact algorithm / scientific coauthorship networks / large-scale hypertextual Web search engine / large-scale social networks / social networks / coauthorship networks / sparse networks / social network / brute-force algorithm / basic algorithm / /

Organization

Kyoto University / Illinois Institute of Technology / Acoustical Society of America / National Academy of Sciences / /

Position

connected scientist / /

ProgrammingLanguage

T / /

ProvinceOrState

Colorado / /

PublishedMedium

Proceedings of the National Academy of Sciences / Journal of the ACM / /

Technology

heuristic Algorithm / SSSP algorithm / ISDN / av / brute-force algorithm / RAND algorithm / approximation algorithm / improved network optimization algorithms / closeness centralities The algorithm / search engine / basic ranking algorithm / 3 Ranking algorithms / well known PageRank algorithm / using approximation algorithm / ranking algorithm / basic algorithm / /

SocialTag