Estimating clique size via discarding subgraphs

The paper will present a method to establish an upper bound on the clique number of a given hnite 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.

Saved in:
Bibliographic Details
Published in:Informatica (Ljubljana) 2021-06, Vol.45 (2), p.197-204
Main Authors: Zavalnij, Bogdan, Szabo, Sandor
Format: Article
Language:English
Subjects:
Algorithms
Complexity theory
Heuristic
Upper bounds
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper will present a method to establish an upper bound on the clique number of a given hnite 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.
ISSN:0350-5596
1854-3871
DOI:10.31449/inf.v45i2.3107