420 search results - page 38 / 84 » Generating random regular graphs |
116
click to vote
LATIN
2004
Springer
15 years 7 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
107
click to vote
CIKM
2008
Springer
15 years 4 months ago
2008
Springer
We introduce a unified graph representation of the Web, which includes both structural and usage information. We model this graph using a simple union of the Web's hyperlink ...
128
click to vote
AOSD
2007
ACM
15 years 6 months ago
2007
ACM
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
114
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
145
click to vote
SAC
2010
ACM
15 years 9 months ago
2010
ACM
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...