Sciweavers

RSA
2000
112views more  RSA 2000»
14 years 7 days ago
Growth of components in random graphs
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
Svante Janson
EJC
2007
14 years 12 days ago
Online balanced graph avoidance games
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
CPC
2006
93views more  CPC 2006»
14 years 14 days ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper
CORR
2010
Springer
60views Education» more  CORR 2010»
14 years 16 days 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...