Is maximum-leaves spanning tree np-complete?
-
05-11-2019 - |
Question
How can we show that a maximum-leaves spanning tree is NP-complete? what other np-complete problem we can use as our reduction base?
(maximum-leaves spanning tree: does G have a spanning tree with at least K leaves? )
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange