Login / Signup

Branch and cut algorithms for detecting critical nodes in undirected graphs.

Marco Di SummaAndrea GrossoMarco Locatelli
Published in: Comput. Optim. Appl. (2012)
Keyphrases
  • undirected graph
  • directed graph
  • random graphs
  • graph structure
  • strongly connected
  • computational complexity
  • dynamic programming
  • social networks
  • objective function
  • data structure
  • higher order
  • graph structures