96 search results - page 14 / 20 » On the scaling of congestion in the internet graph |
GD
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
WEBI
2005
Springer
14 years 29 days ago
2005
Springer
Cycle detection in graphs and digraphs has received wide attention and several algorithms are available for this purpose. While the web may be modeled as a digraph, such algorithm...
WISE
2002
Springer
14 years 12 days ago
2002
Springer
Delta compression techniques are commonly used to succinctly represent an updated version of a file with respect to an earlier one. In this paper, we study the use of delta compr...
JDA
2006
13 years 7 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...