As in the question stated, I am interested in the approximation factor of the greedy approach to compute the arboricity of the graph.
My intuition tells me the factor should not be bigger than $2$, any input is appreciated.
$\begingroup$
$\endgroup$
0
Add a comment
|