maximum_independent_set_bipartite (397B)
1 # Maximum independent set on bipartite graphs 2 3 The [computation_problem] of finding a [maximum_independent_set] in a [bipartite_graph] 4 5 - the complement of a [maximum_independent_set] is a [minimum_vertex_cover] 6 - and then the problem can be solved by [minimum_vertex_cover_bipartite] 7 8 Up: [maximum_independent_set_problem], [graph_bipartite] 9 10 Aliases: Maximum independent set on bipartite graphs