Sciweavers

592 search results - page 87 / 119
» Crossing numbers of random graphs
Sort
View
TAMC
2010
Springer
14 years 1 months ago
Community Structure in Large Complex Networks
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
Liaoruo Wang, John E. Hopcroft
SIGIR
2006
ACM
14 years 1 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 3 days ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
JDWM
2010
180views more  JDWM 2010»
13 years 6 months ago
Investigating the Properties of a Social Bookmarking and Tagging Network
Social networks and collaborative tagging systems are rapidly gaining popularity as a primary means for storing and sharing data among friends, family, colleagues, or perfect stra...
Ralitsa Angelova, Marek Lipczak, Evangelos E. Mili...
CORR
2008
Springer
97views Education» more  CORR 2008»
13 years 8 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett