Back to Results
First PageMeta Content
Network theory / Networks / Shortest path problem / Routing algorithms / Flow network / Interpersonal ties / Routing / Graph / Network science / Graph theory / Mathematics / Theoretical computer science


All Friends are Not Equal: Using Weights in Social Graphs to Improve Search Sudheendra Hangal Diana MacLean
Add to Reading List

Document Date: 2010-08-21 16:25:26


Open Document

File Size: 525,23 KB

Share Result on Facebook

City

Washington D.C. / New York / Deventer / /

Company

LinkedIn / Twitter / Google / Facebook / Kluwer B.V. / Harvard University Press / /

Country

Netherlands / United States / /

Currency

pence / USD / /

/

Facility

Lam Jeffrey Heer Computer Science Department Stanford University / /

IndustryTerm

social search experiment / information that unweighted networks / trust networks / shortest path algorithm / online social networks / large instant-messaging network / large networks / online networks / broken telephone / dense network / search algorithm / computer science bibliography network / binary networks / social media / paper co-authorship network / social search / contemporary networks / co-authorship network / search returns / natural adaptation to this algorithm / social search algorithms / local social search / social search problem / social networks / social network / daily communications / large real-world networks / online social network / real-life social networks / search lies / /

Organization

Harvard University / National Science Foundation / Stanford University / /

Person

Joe / Or John / Diana MacLean / Monica S. Lam / /

Position

advisor / advisors / author / professor / model for global social search / Plumber / representative / adviser / /

ProvinceOrState

New York / /

PublishedMedium

The American Journal of Sociology / /

SportsLeague

Stanford University / /

Technology

search algorithm / shortest path algorithm / Search Engine / social search algorithms / Spectroscopy / /

URL

http /

SocialTag