421 search results - page 17 / 85 » A Survey of Models of the Web Graph |
CN
2002
13 years 8 months ago
2002
Recently several authors have proposed stochastic models of the growth of the Web graph that give rise to power-law distributions. These models are based on the notion of preferen...
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
JDA
2006
13 years 8 months ago
2006
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
SEMWEB
2007
Springer
14 years 2 months ago
2007
Springer
We present the architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collecte...