题目描述 Given a connected undirected graph with n vertices and an integer k, you have to either: either find an independent set that has exactly ⌈k2⌉ vertices. or find a simple cycle of length at most k. An independent set is a set of vertices such that…
Given a connected undirected graph with n n n vertices and an integer k k k, you have to either:
either find an independent set that has exactly ⌈ k 2 ⌉ ⌈\frac{k}{2}⌉ ⌈2k⌉ vertices.or find a simple cycle of length at most k k k.
An independen…