1 citations · 2 across the 8 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Strengthened chain theorems for different versions of 4-connectivity
Guoli Ding, Chengfu Qin
The chain theorem of Tutte states that every 3-connected graph can be constructed from a wheel by repeatedly adding edges and splitting vertices. It is not difficult to prove…
math.CO2020★ 1 cited
Unavoidable Induced Subgraphs of Large 2-Connected Graphs
Sarah Allred, Guoli Ding, Bogdan Oporowski
Ramsey proved that for every positive integer , every sufficiently large graph contains an induced or . Among the many extensions of Ramsey's Theorem there…
cs.DS2020
Online MinCut: Competitive and Regret Analysis
Avah Banerjee, Guoli Ding
In this paper we study the mincut problem in the online setting. We consider two distinct models: A) competitive analysis and B) regret analysis. In the competitive setting we cons…