Browsing University of Waterloo by Subject "random graph"
Now showing items 1-2 of 2
-
Chromatic Number of Random Signed Graphs
(University of Waterloo, 2024-05-03)We naturally extend Bollobas's classical method and result about the chromatic number of random graphs chi(G(n,p)) ~ n/log_b(n) (for p constant, b=1/(1-p)) to the chromatic number of random signed graphs to obtain chi(G(n,p,q)) ... -
Generation and properties of random graphs and analysis of randomized algorithms
(University of Waterloo, 2010-01-22)We study a new method of generating random $d$-regular graphs by repeatedly applying an operation called pegging. The pegging algorithm, which applies the pegging operation in each step, is a method of generating large ...