Nice article Jose!
Another way to describe your greedy solution for vertex cover is by finding a maximal matching in the graph and then taking all of its vertices. It's the same concept, just using another term of graph theory 😊
Another greedy approach for vertex cover that also works pretty well (although a bit less efficient) is repeatedly picking vertices of highest degree.
Mario Cervera
Software craftsman. I write about Software Engineering (clean code, design, testing, ...) and also about Algorithms & Data Structures.