The MaxCliqueDyn algorithm is an algorithm for finding a maximum clique in an undirected graph. It is based on a basic algorithm (MaxClique algorithm) which finds a maximum clique of bounded size. The bound is found using improved coloring algorithm. The MaxCliqueDyn extends MaxClique algorithm to include dynamically varying bounds. This algorithm was designed by Janez Konc and description was published in 2007. In comparison to earlier algorithms described in the published article the MaxCliqueDyn algorithm is improved by an improved approximate coloring algorithm (ColorSort algorithm) and by applying tighter, more computationally expensive upper bounds on a fraction of the search space. Both improvements reduce time to find maximum clique. In addition to reducing time improved coloring
Property  Value 

dbo:abstract 

dbo:thumbnail  
dbo:wikiPageExternalLink  
dbo:wikiPageID 

dbo:wikiPageRevisionID 

dbp:abovestyle 

dbp:data  
dbp:headerstyle 

dbp:label 

dbp:labelstyle 

dct:subject  
rdfs:comment 

rdfs:label 

prov:wasDerivedFrom  
foaf:depiction  
foaf:isPrimaryTopicOf  
is foaf:primaryTopic of 