Open AccessInstances for the Maximum Clique Problem with Hardness Guarantees
Author(s) -
Víctor Campos,
Renato Miguel do Carmo,
Rodrigo Nogueira
Publication year - 2022
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5753/etc.2022.223245
Subject(s) - bounding overwatch , clique , exponential time hypothesis , clique problem , combinatorics , chromatic scale , exponential function , running time , upper and lower bounds , mathematics , function (biology) , clique number , time complexity , discrete mathematics , computer science , algorithm , chordal graph , graph , artificial intelligence , mathematical analysis , 1 planar graph , evolutionary biology , biology