"A note on the complexity of the maximum edge clique partitioning problem ..."

Noriyoshi Sukegawa, Atsushi Miyauchi (2013)

> Home

Details and statistics

DOI: 10.1016/J.DISOPT.2013.08.004

access: open

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/disopt/SukegawaM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/disopt/SukegawaM13
Noriyoshi Sukegawa, Atsushi Miyauchi:
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number. Discret. Optim. 10(4): 331-332 (2013)

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.