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 , combinatorics , chromatic scale , clique problem , running time , exponential function , mathematics , upper and lower bounds , function (biology) , discrete mathematics , time complexity , clique number , computer science , algorithm , chordal graph , graph , artificial intelligence , 1 planar graph , biology , mathematical analysis , evolutionary biology
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom