MaxCliqueDyn algorithm
id:
maxcliquedyn-algorithm-193-5311959
title:
MaxCliqueDyn algorithm
text:
The MaxCliqueDyn algorithm is an algorithm for finding a maximum clique in an undirected graph. MaxCliqueDyn is based on the MaxClique algorithm, which finds a maximum clique of bounded size. The bound is found using a coloring algorithm. MaxCliqueDyn extends MaxClique to include dynamically varying bounds. This algorithm was designed by Janez Konc and its description was published in 2007. In comparison to earlier algorithms, MaxCliqueDyn has an improved coloring algorithm (ColorSort) and appli
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/MaxCliqueDyn_algorithm
date created:
date modified:
2023-11-14T19:21:36Z
main entity:
{"identifier":"Q28446854","url":"https://www.wikidata.org/entity/Q28446854"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/2/2a/MaxCliqueDyn_logo.png","width":232,"height":232}
fields total:
13
integrity:
14