Gregory B. Sorkin

collaborators

2 papers

math.CO2025

Optimally building spanning graphs in semirandom graph processes

Michael Anastos, MaurÃcio Collares, Joshua Erde +3

The semirandom graph process constructs a graph $G$ in a series of rounds, starting with the empty graph on $n$ vertices. In each round, a player is offered a vertex $v$ chosen uni…

math.CO2024

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2 n$ 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 $n$ vertices. In each round, a vertex $u$ is…

Optimally building spanning graphs in semirandom graph processes

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2n Rounds

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than $2 n$ Rounds