YOU SAID:

A vertex cover in a graph is a set of vertices that includes at least one endpoint of every edge, and a vertex cover is minimum if no other vertex cover has fewer vertices.

INTO JAPANESE

グラフ内の頂点カバーは、すべてのエッジの少なくとも 1 つの端点を含む頂点のセットであり、他の頂点カバーの頂点数が少ない場合、頂点カバーは最小になります。

BACK INTO ENGLISH

A vertex cover in a graph is the set of vertices containing at least one endpoint of every edge, and a vertex cover is minimal if other vertex covers have fewer vertices.

INTO JAPANESE

グラフ内の頂点カバーは、各エッジの少なくとも 1 つの端点を含む頂点のセットであり、他の頂点カバーの頂点数が少ない場合、頂点カバーは最小になります。

BACK INTO ENGLISH

A vertex cover in a graph is the set of vertices that contains at least one endpoint of each edge, and a vertex cover is minimal if other vertex covers have fewer vertices.

INTO JAPANESE

グラフ内の頂点カバーは、各エッジの少なくとも 1 つの端点を含む頂点のセットであり、他の頂点カバーの頂点数が少ない場合、頂点カバーは最小になります。

BACK INTO ENGLISH

A vertex cover in a graph is the set of vertices that contains at least one endpoint of each edge, and a vertex cover is minimal if other vertex covers have fewer vertices.