865 search results - page 90 / 173 » Random graph models for the web graph |
279
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
151
click to vote
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
143
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
124
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
130
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
Understanding the graph structure of the Internet is a crucial step for building accurate network models and designing efficient algorithms for Internet applications. Yet, obtaini...