"NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the ..."

Neda Mohammadi, Mehdi Kadivar (2020)

> Home

Details and statistics

DOI: 10.1109/ACCESS.2020.3028112

access: open

type: Journal Article

metadata version: 2020-10-20

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/access/MohammadiK20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/access/MohammadiK20
Neda Mohammadi, Mehdi Kadivar:
NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem. IEEE Access 8: 180045-180053 (2020)

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.