1067 search results - page 137 / 214 » Probabilistic regular graphs |
87
Voted
SIGMETRICS
2005
ACM
15 years 6 months ago
2005
ACM
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
GD
2004
Springer
15 years 6 months 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 ...
101
Voted
GD
2006
Springer
15 years 4 months ago
2006
Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
100
click to vote
SDM
2008
SIAM
15 years 2 months ago
2008
SIAM
The Universum data, defined as a collection of "nonexamples" that do not belong to any class of interest, have been shown to encode some prior knowledge by representing ...
113
Voted
WEA
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...