86 citations · 344 across the 93 of their papers we have counts for
155 papers
Karp's patching algorithm on dense digraph
Alan Frieze
We consider the following question. We are given a dense digraph with vertices and minimum in- and out-degree at least , where is a constant. The edges o…
Diffusion limited aggregation in the layers model
Colin Cooper, Alan Frieze
In the classical model of Diffusion Limited Aggregation (DLA), introduced by Witten and Sander, the process begins with a single particle cluster placed at the origin of a space, a…
Hamilton cycles in random digraphs with minimum degree at least one
Colin Cooper, Alan Frieze
We study the existence of a directed Hamilton cycle in random digraphs with edges where we condition on minimum in- and out-degree at least one. Denote such a random graph by $…
A note on the chromatic number of the square of a sparse random graph
Alan Frieze, Aditya Raut
We show that w.h.p the list chromatic number of the square of for is asymptotically equal to the maximum degree . Since $χ(G^2_{n,p})\leq χ_\…
Weighted tree games
Patrick Bennett, Alan Frieze
We consider a variation on Maker-Breaker games on graphs or digraphs where the edges have random costs. We assume that Maker wishes to choose the edges of a spanning tree, but wish…
Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than Rounds
Alan Frieze, Pu Gao, Calum MacRury +2
The semi-random graph process is an adaptive random graph process in which an online algorithm is initially presented an empty graph on vertices. In each round, a vertex is…