A. Frieze

activity

20242026

most citedHamilton Cycles in Random Graphs: a bibliography

18 citations · 18 across the 1 of their papers we have counts for

collaborators

10 papers

math.CO2026★ 18 cited

Hamilton Cycles in Random Graphs: a bibliography

Alan Frieze

We provide an annotated bibliography for the study of Hamilton cycles in random graphs and hypergraphs.

math.CO2026

The effect of adding randomly weighted edges

Alan Frieze

We consider the following question. We have a dense regular graph $G$ with degree $I^\pm n$ , where $I^\pm > 0$ is a constant. We add $m = o (n^{2})$ random edges. The edges of the augmented grap…

cs.DS2025

Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p

Tolson Bell, Alan Frieze

Let the costs $C (i, j)$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a non-negative random variable $C$ from a class of distributi…

math.CO2025

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 $m$ edges where we condition on minimum in- and out-degree at least one. Denote such a random graph by $…

math.CO2025

Karp's patching algorithm on dense digraph

Alan Frieze

We consider the following question. We are given a dense digraph $D$ with $n$ vertices and minimum in- and out-degree at least $I^\pm n$ , where $I^\pm > 1/2$ is a constant. The edges $E (D)$ …

math.CO2025

Karp's patching algorithm on random perturbations of dense digraphs

Alan Frieze, Peleg Michaeli

We consider the following question. We are given a dense digraph $D_{0}$ with minimum in- and out-degree at least $I^\pm n$ , where $I^\pm > 0$ is a constant. We then add random edges $R$ to $…