Estimating clique size via discarding subgraphs
Sándor Szabó, Bogdán Zaválnij · Informatica · 2021
The paper will present a method to establish an upper bound on the clique number of agiven finite graph. In order to evaluate the proposed algorithm in practice we carry outa large scale numerical experiment.