"Finding maximum subgraphs with relatively large vertex connectivity."

Alexander Veremyev et al. (2014)

> Home

Details and statistics

DOI: 10.1016/J.EJOR.2014.05.041

access: closed

type: Journal Article

metadata version: 2020-03-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/eor/VeremyevPBP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eor/VeremyevPBP14
Alexander Veremyev, Oleg A. Prokopyev, Vladimir Boginski, Eduardo L. Pasiliao:
Finding maximum subgraphs with relatively large vertex connectivity. Eur. J. Oper. Res. 239(2): 349-362 (2014)

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.