Clique Search in Graphs of Special Class and Job Shop Scheduling
In this paper, we single out the following particular case of the clique search problem. The vertices of the given graph are legally colored with <i>k</i> colors and we are looking for a clique with <i>k</i> nodes in the graph. In other words, we want to decide if a given <...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-02-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/10/5/697 |