Logan Grout

most citedOn Decomposing Graphs Into Forests and Pseudoforests

2 citations · 4 across the 2 of their papers we have counts for

collaborators

3 papers

cs.DS2020★ 2 cited

A $4/3$ -Approximation Algorithm for the Minimum $2$ -Edge Connected Multisubgraph Problem in the Half-Integral Case

S. Boyd, J. Cheriyan, R. Cummings +4

Given a connected undirected graph $G ˉ$ on $n$ vertices, and non-negative edge costs $c$ , the 2ECM problem is that of finding a $2$ -edge~connected spanning multisubgraph of $\…

math.CO2019

The Pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is True

Logan Grout, Benjamin Moore

We prove that for any positive integers $k$ and $d$ , if a graph $G$ has maximum average degree at most $2 k + \frac{2 d}{d + k + 1}$ , then $G$ decomposes into $k + 1$ pseudoforests $C_{1},…

math.CO2019★ 2 cited

On Decomposing Graphs Into Forests and Pseudoforests

Logan Grout, Benjamin Moore

We prove that for $k \in N$ and $d \leq 2 k + 2$ , if a graph has maximum average degree at most $2 k + \frac{2 d}{d + k + 1}$ , then $G$ decomposes into $k + 1$ pseudoforests, where o…

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case

The Pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is True

On Decomposing Graphs Into Forests and Pseudoforests

A $4/3$ -Approximation Algorithm for the Minimum $2$ -Edge Connected Multisubgraph Problem in the Half-Integral Case