Learn More
This paper analyzes the problem of maximizing the disconnectivity of undirected graphs by deleting a subset of their nodes. We consider three metrics that measure the connectivity of a graph: The number of connected components (which we attempt to maximize), the largest component size (which we attempt to minimize), and the minimum cost required to(More)
  • 1