Is the following problem NP-complete? Prove your answer a k-star is a node v that has k outgoing edges. Our decision problem is: does G contain a k-star for a given parameter k? Show transcribed image text Is the following problem NP-complete? Prove your answer a k-star is a node v that has k outgoing edges. Our decision problem is: does G contain a k-star for a given parameter k?
Answer