1 citations · 2 across the 8 of their papers we have counts for
13 papers
On extending induced subgraphs
Guoli Ding, Jake Weber, Weihao Xia
When characterizing graphs defined by forbidden induced subgraphs, it is often desirable to understand how a graph can be generated incrementally from a given induced subgraph…
Unavoidable Induced Subgraph of Infinite 2-connected Graphs
Sarah Allred, Guoli Ding, Bogdan Oporowski
In 1930, Ramsey proved that every infinite graph contains either an infinite clique or an infinite independent set as an induced subgraph. König proved that every infinite graph co…
Distributed Matrix Tiling Using A Hypergraph Labeling Formulation
Avah Banerjee, Guoli Ding, Maxwell Reeser
Partitioning large matrices is an important problem in distributed linear algebra computing (used in ML among others). Briefly, our goal is to perform a sequence of matrix algebra…
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…
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…
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…