Michael Anastos

activity

20162025

most citedHamiltonicity of random graphs in the stochastic block model

3 citations · 11 across the 32 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 2 cited

Packing Directed and Hamilton Cycles Online

Michael Anastos, Joseph Briggs

Consider a directed analogue of the random graph process on $n$ vertices, where the $n (n - 1)$ edges are ordered uniformly at random and revealed one at a time. It is known that w.h.…

cs.DS2016

Purchasing a C_4 online

Michael Anastos

Let $G$ be a graph with edge set $(e_{1}, e_{2}, ... e_{N})$ . We independently associate to each edge $e_{i}$ of $G$ a cost $x_{i}$ that is drawn from a Uniform [0, 1] distribution. Suppose $…