Sciweavers

5606 search results - page 34 / 1122
» Randomization Techniques for Graphs.
Sort
View
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 8 months ago
Hitting time results for Maker-Breaker games
We study Maker-Breaker games played on the edge set of a random graph. Specifically, we consider the random graph process and analyze the first time in a typical random graph proc...
Sonny Ben-Shimon, Asaf Ferber, Dan Hefetz, Michael...
COMBINATORICA
2008
87views more  COMBINATORICA 2008»
13 years 8 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira
EJC
2006
13 years 8 months ago
3-star factors in random d-regular graphs
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
Hilda Assiyatun, Nicholas C. Wormald
WWW
2009
ACM
14 years 8 months ago
Graffiti: node labeling in heterogeneous networks
We introduce a multi-label classification model and algorithm for labeling heterogeneous networks, where nodes belong to different types and different types have different sets of...
Ralitsa Angelova, Gjergji Kasneci, Fabian M. Sucha...
WAW
2007
Springer
162views Algorithms» more  WAW 2007»
14 years 2 months ago
Random Dot Product Graph Models for Social Networks
Inspired by the recent interest in combining geometry with random graph models, we explore in this paper two generalizations of the random dot product graph model proposed by Kraet...
Stephen J. Young, Edward R. Scheinerman