Maximum Clique Search in Circulant k-Hypergraphs
The search for max-cliques in graphs is a well established NP-complete problem in graph theory and algorithm design, with many algorithms designed to make use of internal structures of specific types of graphs. We study the extension of the problem of searching for max-cliques in graphs to hypergrap...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2018
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/38464 http://dx.doi.org/10.20381/ruor-22717 |