Another vertex cover question?

cs.stackexchange https://cs.stackexchange.com/questions/115093

문제

I'm not sure this is equivalent to bipartite vertex cover question. The question is:

Given a BIPARTITE graph, what is the minimum number of vertex from the right side whose edges cover all vertex from the left side.

e.g. In the following graph, the answer is 1, cause vertex g has connection to all vertex on the left. enter image description here

올바른 솔루션이 없습니다

라이센스 : CC-BY-SA ~와 함께 속성
제휴하지 않습니다 cs.stackexchange
scroll top