3

Does anyone know the the generic outline for the brute force algorithm for finding the maximum independent vertex set in a bipartite graph?

I know there are other algorithms such as König's Theorem for finding MIS, but I was wondering what the pseudocode for the brute force method would be?

In addition, what would be the run time complexity of such a brute force algorithm?

DSM
  • 342,061
  • 65
  • 592
  • 494
user1084113
  • 932
  • 3
  • 15
  • 31

1 Answers1

3

The brute force algorithm is just to iterate over all sets of vertices and check if they are independent. There are 2^n sets of vertices and iterating over all edges to check for independence is O(m), so this costs O(2^n*m).

Jonathan Paulson
  • 1,048
  • 6
  • 15
  • What do the m and n represent, I assume m is the number of edges and n is the number of vertices? – user1084113 Sep 17 '12 at 03:00
  • If there are `2^n` subsets, then `n` must be the number of vertices. The maximum value of `m` is `n * (n -1) / 2`, hence the complexity as a functions of number vertices becomes `O(2^n * n * (n-1)/2)` – fnisi Apr 13 '19 at 15:26