Estimating clique size via discarding subgraphs

Abstract

The paper will present a method to establish an upper bound on the clique number of a given finite simple graph. In order to evaluate the performance of the proposed algorithm in practice we carry out a large scale numerical experiment on carefully selected benchmark instances.Povzetek: Razvita in opisana je nova metoda za določanje zgornje meje števila klik v grafu.