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.



Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge that you have read and understand our privacy policy and code of conduct.

Browse other questions tagged or ask your own question.