A parameter-independent algorithm of finding maximum clique with Seidel continuous-time quantum walks
Summary: The maximum clique (MC) problem holds significance in network analysis. Quantum-based algorithms have recently emerged as promising approaches for this problem. However, these algorithms heavily depend on parameters of quantum system and vary significantly for different graphs. In order to...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-02-01
|
| Series: | iScience |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2589004224001743 |