MaximumIndependentSet
To obtain a maximum independent set of a graph, find a max clique of the complement. If the graph is bipartite, see MinimumVertexCover.
0 lines
content/graph/MaximumIndependentSet.h — chilli, source: Wikipedia
To obtain a maximum independent set of a graph, find a max clique of the complement. If the graph is bipartite, see MinimumVertexCover.
0 lines
content/graph/MaximumIndependentSet.h — chilli, source: Wikipedia