Benchmark problems for exhaustive exact maximum clique search algorithms

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.

Saved in:
Bibliographic Details
Published in:Informatica (Ljubljana) 2019-06, Vol.43 (2), p.177-186
Main Authors: Szabó, Sándor, Zaválnij, Bogdán
Format: Article
Language:English
Subjects:
Algorithms
Benchmarks
Search algorithms
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0350-5596
1854-3871
DOI:10.31449/inf.v43i2.2678