This is a distributed systems problem, but perhaps the graph theory gurus can help me.I need an algorithm that that tells me which nodes to remove from the graph to completely remove connectivity. See example: The most intelligently thing to do would be to remove the bcasts nodes:Can you help me? One way to solve this would using a SAT or ILP solver, but I want to if there are any other algorithms for this kind of task.
algorithm to delete nodes that completely removes connectivity
graph theory