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

Marco Di Summa, Andrea Grosso, Marco Locatelli (2012)

> Home

Details and statistics

DOI: 10.1007/S10589-012-9458-Y

access: closed

type: Journal Article

metadata version: 2020-07-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/coap/SummaGL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/coap/SummaGL12
Marco Di Summa, Andrea Grosso, Marco Locatelli:
Branch and cut algorithms for detecting critical nodes in undirected graphs. Comput. Optim. Appl. 53(3): 649-680 (2012)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.