given an undirected graph, you have to remove some nodes to maximize the number of connected components.
when romoving a node, you have to remove all its edges.
maximize the number of connected components in a graph.
given an undirected graph, you have to remove some nodes to maximize the number of connected components.
when romoving a node, you have to remove all its edges.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | TuHoangAnh | 2022-02-11 12:37:34 | 2 | Tiny change: '\n\nwhen romoving a n' -> '\n\nwhen removing a n' | ||
en1 | TuHoangAnh | 2022-02-11 12:33:22 | 220 | Initial revision (published) |