Szabó, Sándor and Zaválnij, Bogdán (2019) Benchmark Problems for Exhaustive Exact Maximum Clique Search Algorithms. Informatica : An International Journal of Computing and Informatics, 43 (2). pp. 177-186. ISSN 0350-5596
|
Text
2678-5709-1-PB.pdf Available under License Creative Commons Attribution. Download (318kB) | Preview |
Official URL: http://doi.org/10.31449/inf.v43i2.2678
Abstract
There are well established widely used benchmark tests to assess the performance of practical exact clique search algorithms. In this paper a family of further benchmark problems is proposed mainly to test exhaustive clique search procedures.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | clique, maximal clique, maximum clique, graph coloring, random graph, Mycielski graph |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 09 Oct 2019 07:34 |
| Last Modified: | 09 Oct 2019 07:34 |
| URI: | http://real.mtak.hu/id/eprint/102151 |
Actions (login required)
 |
Edit Item |
