Szabó, Sándor and Zaválnij, Bogdán (2021) Estimating clique size via discarding subgraphs. INFORMATICA-JOURNAL OF COMPUTING AND INFORMATICS, 45 (2). pp. 197-204. ISSN 0350-5596
|
Text
3107-8039-1-PB.pdf - Published Version Available under License Creative Commons Attribution. Download (259kB) | Preview |
Official URL: https://doi.org/10.31449/inf.v45i2.3107
Abstract
The paper will present a method to establish an upper bound on the clique number of a given finite graph. In order to evaluate the proposed algorithm in practice we carry out a large scale numerical experiment.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 13 Jul 2025 06:24 |
| Last Modified: | 13 Jul 2025 06:24 |
| URI: | https://real.mtak.hu/id/eprint/221016 |
Actions (login required)
 |
Edit Item |
