Related problems are added for NP Problem's special cases

Author: Hamid Gasmi

README.md

@@ -2746,6 +2746,7 @@
         - The proof of this theorem is **constructive**: it provides a polynomial time algorithm that transforms a given maximum matching into a minimum vertex cover 
         - In turn, a maximum matching can be found using **flow techniques**
 - Related Problems:
+    - [Integrated Circuit Design](https://github.com/hamidgasmi/training.computerscience.algorithms-datastructures/issues/148)
     - Plan a fun party 1:
         - We're organizing a company party
         - We would like to invite as many people as possible with a single constraint