Notable Question
Question with 2,500 views. This badge can be awarded multiple times.
earned this badge 1 time.
Prove that Acyclic Subgraph is NP-Hard by showing Independent Set can be reduced to Acyclic Subgraph
Awarded Jan 14, 2022 at 1:41