"Decomposing clique search problems into smaller instances based on node ..."

Sándor Szabó, Bogdán Zaválnij (2018)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2018.01.006

access: open

type: Journal Article

metadata version: 2021-12-25

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/SzaboZ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/SzaboZ18
Sándor Szabó, Bogdán Zaválnij:
Decomposing clique search problems into smaller instances based on node and edge colorings. Discret. Appl. Math. 242: 118-129 (2018)

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.