title: An efficient way to find minimum edge cover using dynamic programming
body: <p>Given an undirected graph with no self loops and parallel edges.</p>
  
  <p>My objective is to find the <code>minimum edge cover</code>. I came to know that it can be done efficiently using <code>bitmask DP</code>. I have tried a lot but unable to figure out how to define the <code>state of DP</code>. Please help in deciding the <code>DP</code> state.</p>